A hypergraph approach to the identifying parent property: The case of multiple parents

SIAM Journal on Discrete Mathematics

Volumn 14, Issue 3, 2001, Pages 423-431

  Barg, Alexander ^a,d   Cohen, Gérard ^b   Encheva, Sylvia ^c   Kabatiansky, Gregory ^d,e   Zémor, Gilles ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b TELECOM PARISTECH   (France)

^c WESTERN NORWAY UNIVERSITY OF APPLIED SCIENCES   (Norway)

^d RUSSIAN ACADEMY OF SCIENCES   (Russian Federation)

^e RUTGERS UNIVERSITY   (United States)

Author keywords

Error correcting codes; Helly property; Identifying parent property

Indexed keywords

EID: 0001070499     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100376848     Document Type: Article

References (15)

1. L. A. BASSALYGO, M BURMESTER, A. DYACHKOV, AND G. KABATIANSKI. Hash codes, in Proceedings of the IEEE International Symposium on Information Theory, Ulm, Germany, 1997, p. 174.
2. L. A BASSALYGO, S. I. GELFAND, AND M. S. PINSKER, Simple methods for obtaining lower bounds in coding theory, Problems Inform. Transmission, 27 (1991), pp. 277-281.
3. C. BERGE AND P. DUCHET, A generalisation of Gilmore's theorem, in Recent Advances in Graph Theory, M. Fiedler, ed., Academia, Prague, 1975, pp. 49-55.
4. D. BONEH AND J. SHAW, Collusion-secure fingerprinting for digital data, IEEE Trans. Inform. Theory, 44 (1998), pp. 480-491.
5. B. CHOR, A. FIAT, AND M. NAOR, Tracing traitors, in Advances in Cryptology-CRYPTO'94, Lecture Notes in Comput. Sci. 839, Springer-Verlag, Berlin, 1994, pp. 257-270.
6. P. DUCHET, Hypergraphs, in Handbook of Combinatorics, Vol. 1. R. L. Graham, M. Grötschel and L. Lovász, eds., North-Holland, Amsterdam, 1995, pp. 381-432.
7. M. L FREDMAN AND J. KOMLÓS, On the size of separating systems and families of perfect hash functions, SIAM J. Algebraic Discrete Methods, 5 (1984), pp. 61-68.
8. A. D. FRIEDMAN, R. L. GRAHAM, AND J. D. ULLMAN, Universal single transition time asynchronous state assignments, IEEE Trans. Comput., 18 (1969), pp. 541-547.
9. H. D. L HOLLMANN, J. H. VAN LINT, J.-P. LINNARTZ, AND L. M. G. M. TOLHUIZEN, On codes with the identifiable parent property, J. Combin. Theory Ser. A, 82 (1998), pp. 121-133.
10. J. KÖRNER AND A. ORLITSKI, Zero-error information theory, IEEE Trans. Inform. Theory, 44 (1998), pp. 2207-2229.
11. J. KÖRNER AND G. SIMONYI, Separating partition systems and locally different sequences, SIAM J. Discrete Math., 1 (1988), pp. 355-359.
12. J. H. VAN LINT, Introduction to Coding Theory, Springer-Verlag, Berlin, 1982.
13. M. S. PINSKER AND YU L. SAGALOVICH, Lower bound for the power of an automaton state code, Problems Inform. Transmission, 8 (1972), pp. 224-230
14. YU. L. SAGALOVICH, Separating systems, Problems Inform. Transmission, 30 (1994), pp. 105-123.
15. J. N. STADDON, D. R. STINSON, AND R. WEI, Combinatorial properties of frameproof and traceability codes, IEEE Trans. Inform. Theory. 47 (2001), pp. 1042-1049.