Cover-free families and superimposed codes: Constructions, bounds, and applications to cryptography and group testing

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2001, Pages 117-

  D'yachkov, A G ^a   Lebedev, V S ^a   Vilenkin, P A ^a   Yekhanin, S M ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC BOUNDS; COVER FREE FAMILIES; GROUP TESTING; REED SOLOMON CODES; SUPERIMPOSED CODES;

ALGORITHMS; ASYMPTOTIC STABILITY; BOUNDARY CONDITIONS; CRYPTOGRAPHY; MATRIX ALGEBRA; SET THEORY;

BINARY CODES;

EID: 0034851211     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Nonrandom binary superimposed codes
2. Bounds on the length of disjunct codes
3. Key storage in secure networks
4. Superimposed distance codes
5. Separating systems
6. On key storage in secure networks
7. Interval packing and covering in the boolean lattice
8. New constructions of superimposed codes
9. New applications and results of superimposed code theory arising from the potentialities of molecular biology
10. New results in the theory of superimposed codes
11. Some new bounds for cover-free families
12. Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
13. Asymptotic problems of combinatorial coding theory and information theory