Upper bounds on separating codes

IEEE Transactions on Information Theory

Volumn 50, Issue 6, 2004, Pages 1291-1295

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

^a TELECOM PARISTECH   (France)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Error correcting codes; Hashing; Separating systems; Superimposed codes

Indexed keywords

AUTOMATA THEORY; ERROR ANALYSIS; ERROR CORRECTION; THEOREM PROVING;

HASHING; SEPARATING SYSTEM; SUPERIMPOSED CODE;

CODES (SYMBOLS);

EID: 2942685503     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.828140     Document Type: Letter

References (24)

1. M. Aaltonen, "A new upper bound on nonbinary block codes," Discr. Math., vol. 83, no. 2-3, pp. 139-160, 1990.
2. M. J. Aaltonen, "Linear programming bounds for tree codes," IEEE Trans. Inform. Theory, vol. IT-25, pp. 85-90, Jan. 1979.
3. A. Brag, G. R. Blakley, and G. A. Kabatiansky, "Digital fingerprinting codes: Problem statements, constructions, identification of traitors," IEEE Trans. Inform. Theory, vol. 49, pp. 852-865, Apr. 2003.
4. A. Barg, G. Cohen, S. Encheva, G. Kabatiansky, and G. Zémor, "A hypergraph approach to the identifying parent property," SIAM J. Discr. Math., vol. 14, no. 3, pp. 423-431, 2001.
5. S. R. Blackburn, "Frameproof codes," SIAM J. Discr. Math., vol. 16, no. 3, pp. 499-510, 2003.
6. D. Boneh and J. Shaw, "Collusion-secure fingerprinting for digital data," IEEE Trans. Inform. Theory, vol. 44, pp. 1897-1905, Sept. 1998.
7. B. Chor, A. Fiat, and M. Naor, "Tracing traitors," in Advances in Cryptology - CRYPTO '94 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1994, vol. 839, pp. 257-270.
8. F. Chung, R. Graham, and T. Leighton, "Guessing secrets," Electron. J. Combin., vol. 8, p. R13, 2001.
9. G. D. Cohen, S. B. Encheva, S. Litsyn, and H. B. Schaathun, "Intersecting codes and separating codes," Discr. Appl. Math., vol. 128, no. 1, pp. 75-83, 2003.
10. G. D. Cohen and H. G. Schaathum, "New upper bounds on separating codes," in Proc. 2003 Int. Conf. Telecommunications, Feb. 2003, pp. 1990-1994.
11. A. G. D'yachkov and V. V. Rykov, "A survey of superimposed code theory" (in Russian), Probl. Control Inform. Theory/Probl. Upravlen. Teor. Inform., vol. 12, no. 4, pp. 229-242, 1983.
12. A. G. 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. Combin. Theory, vol. 99, pp. 195-208, 2002.
13. J. Garay, J. Staddon, and A. Wool, "Long-lived broadcast encryption," in Proc. Crypto 2000 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2000, vol. 1880, pp. 333-352.
14. W. Kautz and R. Singleton, "Nonrandom binary superimposed codes," IEEE Trans. Inform. Theory, vol. IT-10, pp. 363-377, Oct. 1964.
15. H. K. Kim, V. Lebedev, and D. Y. Oh, "Some new results on (w, r) superimposed codes," preprint, 2003.
16. J. Körner and G. Simonyi, "Separating partition systems and locally different sequences," SIAM J. Discr. Math., vol. 1, pp. 355-359, 1988.
17. R. Kumar, S. Rajagopalan, and A. Sahai, "Coding constructions for blacklisting problems without computational assumptions," in Proc. Crypto'99 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1666, pp. 609-623.
18. T. Laihonen and S. Litsyn, "On upper bounds for minimum distance and covering radius of nonbinary codes," Des., Codes, Cryptogr., vol. 14, no. 1, pp. 71-80, 1998.
19. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
20. R. J. McEliece, E. R. Rodemich, H. Rumsey Jr, and L. R. Welch, "New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities," IEEE Trans. Inform. Theory, vol. IT-23, pp. 157-166, Mar. 1977.
21. Y. L. Saglovich, "Separating systems," Probl. Inform. Transm., vol. 30, no. 2, pp. 105-123, 1994.
22. H. G. Schaathun, "Fighting three pirates with scattering codes," in Proc. Int. Symp. Information Theory (ISIT'04), Chicago, IL, June/July 2003, to be published.
23. ____, "Fighting two pirates," in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2003, vol. 2643, pp. 71-78.
24. J. N. Staddon, D. R. Stinson, and R. Wei, "Combinatorial properties of frameproof and traceability codes," IEEE Trans. Inform. Theory, vol. 47, pp. 1042-1049, Mar. 2001.