New upper bounds on separating codes

10th International Conference on Telecommunications, ICT 2003

Volumn 2, Issue , 2003, Pages 1290-1293

  Cohen, Gérard ^a   Schaathun, Hans Georg ^b  

^a TELECOM PARISTECH   (France)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Copyright protection; Separating code

Indexed keywords

CODES (SYMBOLS); SEPARATION;

COPYRIGHT PROTECTIONS; FINGERPRINTING CODE; FINGERPRINTING SCHEMES; SEPARATING CODE; UPPER BOUND;

COPYRIGHTS;

EID: 84943771278     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTEL.2003.1191621     Document Type: Conference Paper

References (10)

1. A. Barg, G. Blakley and G. Kabatiansky, "Digital fingerprinting codes", DIMACS Technical Report 2001-52 (2001).
2. D. Boneh and J. Shaw, "Collusion-secure fingerprinting for digital data", IEEE Trans. on Inf. Theory, 44 (1998), pp. 480-491.
3. B. Chor, A. Fiat and M. Naor, "Tracing traitors", Crypto'94 LNCS 839 (1994), pp. 257-270.
4. J. Körner and G. Simonyi, "Separating partition systems and locally different sequences," SIAM J. Discrete Math., 1 No 3 (1988) pp. 355-359.
5. Yu. L. Sagalovich, "Separating systems", Probl. Inform. Trans. 30 No 2 (1994) pp. 105-123.
6. D.R. Stinson and R. Wei, "Combinatorial properties and constructions of traceability schemes and frame-proof codes", SIAM J. Discrete Math., 11 (1998) pp. 41-53.
7. A. Barg, G. Cohen, S. Encheva, G. Kabatiansky and G. Zémor, "A hypergraph approach to the identifying parent property", SIAM J. Disc. Math., vol. 14, 3 (2001) pp.423-431.
8. G. Cohen, S. Encheva and H.-G. Schaathun, "More on (2, 2)-separating systems", IEEE Trans. Inform. Theory, vol. 48, 9 (2002) pp. 2606-2609.
9. A. D'yachkov, P. Vilenkin, A. Macula and D. Torney, "Families of finite sets in which no intersection of ℓ sets is covered by the union of s others", J. Combinatorial Theory, vol. 99, 195-208 (2002).
10. M.A. Tsfasmann, "Algebraic-geometric codes and asymptotic problems", Discrete Applied Math., vol. 33 (1991) pp. 241-256.