Tracing many users with almost no rate penalty

IEEE Transactions on Information Theory

Volumn 53, Issue 1, 2007, Pages 437-439

  Alon, Noga ^a,b   Asodi, Vera ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Multiple user tracing codes; Probabilistic construction of codes; Superimposed codes

Indexed keywords

CODES (SYMBOLS); ENCODING (SYMBOLS); ESTIMATION; SET THEORY;

MULTIPLE-USER TRACING; PROBABILISTIC CONSTRUCTION OF CODES; SUPERIMPOSED CODES;

INFORMATION THEORY;

EID: 33846084135     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.887089     Document Type: Article

References (9)

1. A. G. Dyachkov and V. V. Rykov, "Bounds on the length of disjunctive codes," Probl. Pered. Inform., vol. 18, no. 3, pp. 158-166, 1982.
2. P. Erdós, P. Frankl, and Z. Füredi, "Families of finite sets in which no set is covered by the union of r others," Israel J. Math., vol. 51, pp. 79-89, 1985.
3. Z. Füredi, "A note on r-cover-free families," J. Comb. Theory Ser. A, vol. 73, no. 1, pp. 172-173, 1996.
4. F. K. Hwang and V. T. Sós, "Non-adaptive hypergeometric group testing," Stud. Sci. Math. Hungarica, vol. 22, pp. 257-263, 1987.
5. W. H. Kautz and R. C. Singleton, "Nonrandom binary superimposed codes," IEEE Trans. Inf. Theory, vol. IT-10, no. 4, pp. 363-377, Oct. 1964.
6. M. Ruszinkó, "On the upper bound of the size of the r-cover-free families," J. Comb. Theory Ser. A, vol. 66, no. 2, pp. 302-310, 1994.
7. M. Csúrös and M. Ruszinkó, "Single-user tracing and disjointly superimposed codes," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1606-1611, Apr. 2005.
8. N. Alon and V. Asodi, "Tracing a single user," Europ. J. Comb., vol. 27, pp. 1227-1234, 2006.
9. B. Laczay and M. Ruszinkó, Multiple User Tracing Codes, submitted for publication.