New bounds on parent-identifying codes: The case of multiple parents

Combinatorics Probability and Computing

Volumn 13, Issue 6, 2004, Pages 795-807

  Alon, Noga ^a   Stav, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; PROBABILITY; SET THEORY; THEOREM PROVING;

ALPHABETS; CODEWORDS; MULTIPLE PARENTS; PARENT-IDENTIFYING CODES;

CODES (SYMBOLS);

EID: 9744257021     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548304006388     Document Type: Article

References (13)

1. Alon, N., Cohen, G., Krivelevich, M. and Litsyn, S. (2003) Generalized hashing and parent identifying codes. J. Combin. Theory Ser. A 104 209-215.
2. Alon, N., Fischer, E. and Szegedy, M. (2001) Parent-identifying codes. J. Combin. Theory Ser. A 95 349-359.
3. Alon, N., Duke, R. A., Lefmann, H., Rödl, V. and Yuster, R. (1994) The algorithmic aspects of the Regularity Lemma. In Proc. the 33rd IEEE FOCS. Pittsburgh 1992, pp. 473-481. Also: J. Algorithms 16 80-109.
4. Alon, N., Duke, R. A., Lefmann, H., Rödl, V. and Yuster, R. (1994) The algorithmic aspects of the Regularity Lemma. In Proc. the 33rd IEEE FOCS. Pittsburgh 1992, pp. 473-481. Also: J. Algorithms 16 80-109.
5. Barg, A., Blakley, G. R. and Kabatiansky, G. (2003) Digital fingerprinting codes: Problem statements, constructions, identification of traitors. IEEE Trans. Inform. Theory 49 852-865.
6. Barg, A., Cohen, G., Encheva, S., Kabatiansky, G. and Zemor, G. (2001) A hypergraph approach to the identifying parent property: The case of multiple parents. SIAM J. Disc. Math. 14 423-431.
7. Blackburn, S. R. (2003) An upper bound on the size or a code with the k-identifiable parent property. J. Combin. Theory Ser. A 102 179-185.
8. Boneh, D. and Shaw, J. (1998) Collusion-secure fingerprinting for digital data. IEEE Trans. Inform. Theory 44 1897-1905.
9. Chor, B., Fiat, A. and Naor, M. (1994) Tracing traitors. In Crypto'94, Vol. 839 of Lecture Notes in Computer Science, Springer, pp. 257-270.
10. Hollmann, H. D. L., Van Lint, J. H., Linnartz, J.-P. and Tolhuizen, L. M. G. M. (1998) On codes with the identifiable parent property. J. Combin. Theory Ser. A 82 121-133.
11. Staddon, J. N., Stinson, D. R. and Wei, R. (2001) Combinatorial properties of frameproof and traccability codes. IEEE Trans. Inform. Theory 47 1042-1049.
12. Szemerédi, E. (1978) Regular partitions of graphs. In Proc. Colloque Inter. CNRS, No. 260 (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds), pp. 399-401.
13. Yemane, Y. (2002) Codes with the k-identifiable parent property. PhD Thesis, Royal Holloway, University of London.