Generalized hashing and parent-identifying codes

Journal of Combinatorial Theory. Series A

Volumn 104, Issue 1, 2003, Pages 207-215

  Alon, Noga ^a   Cohen, Gérard ^b   Krivelevich, Michael ^a   Litsyn, Simon ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345015423     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcta.2003.08.001     Document Type: Article

References (17)

1. N. Alon, J. Bruck, J. Naor, M. Naor, R. Roth, Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs, IEEE Trans. Inform. Theory 38 (1992) 509-516.
2. N. Alon, E. Fischer, M. Szegedy, Parent-identifying codes, J. Combin. Theory Ser. A 95 (2001) 349-359.
3. N. Alon, U. Stav, New bounds on parent-identifying codes: the case of multiple parents, submitted for publication.
4. A. Barg, G. Cohen, S. Encheva, G. Kabatiansky, G. Zémor, A hypergraph approach to the identifying parent property, SIAM J. Discrete Math. 14 (2001) 423-432.
5. S. Blackburn, An upper bound on the size of a code with the k-identifiable parent property, J. Combin. Theory Ser. A 102 (2003) 179-185.
6. D. Boneh, J. Shaw, Collusion-secure fingerprinting for digital data, IEEE Trans. Inform. Theory 44 (1998) 480-491.
7. B. Chor, A. Fiat, M. Naor, Tracing traitors, Crypto'94, Lecture Notes in Computer Science, Vol. 839, Springer, Berlin, 1994, pp. 257-270.
8. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, 1990 (Chapter 12).
9. M. Fredman, J. Komlós, On the size of separating systems and perfect hash functions, SIAM J. Algebraic Discrete Methods 5 (1983) 61-68.
10. H.D.L. Hollmann, J.H. van Lint, J.-P. Linnartz, L.M.G.M. Tolhuizen, On codes with the identifiable parent property, J. Combin. Theory Ser. A 82 (1998) 121-133.
11. G.L. Katsman, M.A. Tsfasman, S.G. Vlǎduţ, Modular curves and codes with a polynomial construction, IEEE Trans. Inform. Theory 30 (1984) 353-355.
12. J. Körner, Fredman-Komlós bounds and information theory, SIAM J. Algebraic Discrete Methods 7 (1986) 560-570.
13. J. Körner, K. Marton, New bounds for perfect hashing via information theory, European J. Combin. 9 (1988) 523-530.
14. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
15. A. Nilli, Perfect hashing and probability, Combin. Probab. Comput. 3 (1994) 407-409.
16. J.N. Staddon, D.R. Stinson, R. Wei, Combinatorial properties of frameproof and traceability codes, IEEE Trans. Inform. Theory 47 (2001) 1042-1049.
17. M.A. Tsfasman, S.G. Vlǎduţ, Th. Zink, Modular curves, Shimura curves, and Goppa codes, better than Varshamov Gilbert bound, Math. Nachr. 109 (1982) 21-28.