Families of finite sets in which no intersection of ℓ sets is covered by the union of s others

Journal of Combinatorial Theory. Series A

Volumn 99, Issue 2, 2002, Pages 195-218

  D'Yachkov, A ^a   Vilenkin, P ^a   Torney, D ^b   Macula, A ^c  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b STATE UNIVERSITY OF NEW YORK   (United States)

^c LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Concatenated codes; Cover free family; MDS codes; Rate of code; Separating codes; Superimposed code; Superimposed design

Indexed keywords

EID: 0036046072     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.2002.3257     Document Type: Article

References (21)

1. "Combinatorial Group Testing and Its Applications"
2. Bounds on the length of disjunct codes
3. A survey of superimposed code theory
4. Superimposed distance codes
5. New constructions of superimposed codes
6. New applications and results of superimposed code theory arising from the potentialities of molecular biology
7. New results in the theory of superimposed codes
8. Two models of nonadaptive group testing for designing screening experiments
9. Interval packing and covering in the Boolean lattice
10. Families of finite sets in which no set is covered by the union of two others
11. Families of finite sets in which no set is covered by the union of r others
12. A note of r-cover-free families
13. "Information Theory and Reliable Communication"
14. Nonrandom binary superimposed codes
15. On optimal cover-free families, superimposed codes and key distribution patterns
16. "The Theory of Error-Correcting Codes"
17. Bounds on constant weight binary superimposed codes
18. On the upper bound of the size of r-cover-free families
19. On separating systems
20. Some new bounds for cover-free families
21. "Asymptotic Problems of Combinatorial Coding Theory and Information Theory"