The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tran van Trung: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tamás Horváth, Spyros S. Magliveras, Tran van Trung
    A Parallel Permutation Multiplier for a PGM Crypto-chip. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:108-113 [Conf]
  2. Valér Canda, Tran van Trung, Spyros S. Magliveras, Tamás Horváth
    Symmetric Block Ciphers Based on Group Bases. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2000, pp:89-105 [Conf]
  3. Jürgen Bierbrauer, Tran van Trung
    Some Highly Symmetric Authentication Perpendicular Arrays. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1991, v:1, n:4, pp:307-319 [Journal]
  4. Jürgen Bierbrauer, Tran van Trung
    Halving PGL(2, 2f), f odd: A Series of Cryptocodes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1991, v:1, n:2, pp:141-148 [Journal]
  5. Otokar Grosek, Peter Horák, Tran van Trung
    On Non-Polynomial Latin Squares. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:32, n:1-3, pp:217-226 [Journal]
  6. Sosina Martirosyan, Tran van Trung
    On t-Covering Arrays. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:32, n:1-3, pp:323-339 [Journal]
  7. Rudolf Mathon, Tran van Trung
    Unitals and Unitary Polarities in Symmetric Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:10, n:2, pp:237-250 [Journal]
  8. Rudolf Mathon, Tran van Trung
    Directed-Packings and Directed -Steiner Systems. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:18, n:1/3, pp:187-198 [Journal]
  9. Douglas R. Stinson, Tran van Trung
    Some New Results on Key Distribution Patterns and Broadcast Encryption. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:14, n:3, pp:261-279 [Journal]
  10. Tran van Trung
    On the Construction of Authentication and Secrecy Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1995, v:5, n:3, pp:269-280 [Journal]
  11. Tran van Trung
    A Generalization of a Theorem of Dehon for Simple t-Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:9, n:1, pp:105-114 [Journal]
  12. Tran van Trung, Sosina Martirosyan
    On a Class of Traceability Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:31, n:2, pp:125-132 [Journal]
  13. Tran van Trung, Sosina Martirosyan
    New Constructions for IPP Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:35, n:2, pp:227-239 [Journal]
  14. Charles J. Colbourn, Sosina Martirosyan, Tran van Trung, Robert A. Walker
    Roux-type constructions for covering arrays of strengths three and four. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:41, n:1, pp:33-57 [Journal]
  15. Zvonimir Janko, Tran van Trung
    On Projective Planes of Order 12 Which Have a Subplane of Order 3, I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:29, n:2, pp:254-256 [Journal]
  16. Zvonimir Janko, Tran van Trung
    The Classification of Projective Planes of Order 9 Which Possess an Involution. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:33, n:1, pp:65-75 [Journal]
  17. Zvonimir Janko, Tran van Trung
    Two New Semibiplanes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:33, n:1, pp:102-105 [Journal]
  18. Zvonimir Janko, Tran van Trung
    A Generalization of a Result of L. Baumert and M. Hall About Projective Planes of Order 12. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:32, n:3, pp:378-385 [Journal]
  19. Zvonimir Janko, Tran van Trung
    Projective Planes of Order 12 Do Not Have a Four Group as a Collineation Group. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:32, n:3, pp:401-404 [Journal]
  20. Zvonimir Janko, Tran van Trung
    Answers on Two Questions about Semi-symmetric Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:3, pp:357-358 [Journal]
  21. Zvonimir Janko, Tran van Trung
    Construction of a New Symmetric Block Design for (78, 22, 6) with the Help of Tactical Decompositions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:40, n:2, pp:451-455 [Journal]
  22. Zvonimir Janko, Tran van Trung
    A new biplane of order 9 with a small automorphism group. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:2, pp:305-309 [Journal]
  23. Zvonimir Janko, Tran van Trung
    Answers to two questions about semi-symmetric designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:41, n:2, pp:276-277 [Journal]
  24. Tran van Trung
    The Existence of Symmetric Block Designs with Parameters (41, 16, 6) and (66, 26, 10). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:33, n:2, pp:201-204 [Journal]
  25. Tran van Trung
    A Symmetric Block Design with Parameters (61, 16, 4). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:3, pp:374- [Journal]
  26. Tran van Trung
    Non-embeddable quasi-residual designs with k lt v/2. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:43, n:1, pp:133-137 [Journal]
  27. Tran van Trung
    Maximal arcs and related designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:57, n:2, pp:294-301 [Journal]
  28. Spyros S. Magliveras, Douglas R. Stinson, Tran van Trung
    New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2002, v:15, n:4, pp:285-297 [Journal]
  29. Zvonimir Janko, Tran van Trung
    Construction of two symmetric block designs for (71, 21, 6). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:3, pp:327-328 [Journal]
  30. Earl S. Kramer, Qiu-Rong Wu, Spyros S. Magliveras, Tran van Trung
    Some perpendicular arrays for arbitrarily large t. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:2, pp:101-110 [Journal]
  31. Tran van Trung
    Some existence theorems for t-designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:128, n:1-3, pp:337-348 [Journal]

  32. Explicit constructions for perfect hash families. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002