An upper bound on the size of a code with the k-identifiable parent property

Journal of Combinatorial Theory. Series A

Volumn 102, Issue 1, 2003, Pages 179-185

  Blackburn, Simon R ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Fingerprinting; Identifiable parent property

Indexed keywords

EID: 0037692013     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-3165(03)00030-X     Document Type: Article

References (7)

1. N. Alon, E. Fischer, M. Szegedy, Parent-identifying codes, J. Combin. Theory Ser. A 95 (2001) 349-359.
2. N. Alon, U. Stav, New bounds on parent-identifying codes, preprint, 2002. Available from: www.math.tau.ac.il/~nogaa/
3. A. Barg, G. Cohen, S. Encheva, G. Kabatiansky, G. Zémor, A hypergraph approach to the identifying parent property: the case of multiple parents, SIAM J. Discrete Math. 14 (2001) 423-431.
4. B. Chor, A. Fiat, M. Naor, Tracing traitors, in: Y.G. Desmedt (Ed.), Advances in Cryptology - CRYPTO'94, Lecture Notes in Computer Science, Vol. 839, Springer, Berlin, 1994, pp. 257-270.
5. 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.
6. J.N. Staddon, D.R. Stinson, R. Wei, Combinatorial properties of frameproof and traceability codes, IEEE Trans. Inform. Theory 47 (2001) 1042-1049.
7. Y. Yemane, Codes with the k-identifiable parent property, Ph.D. Thesis, Royal Holloway, University of London, 2002.