On the upper bound of the size of the r-cover-free families

Journal of Combinatorial Theory, Series A

Volumn 66, Issue 2, 1994, Pages 302-310

  Ruszinkó, Miklós ^a  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38149147626     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/0097-3165(94)90067-1     Document Type: Article

References (19)

1. Bounds on constant weight binary superimposed codes
2. Explicit contractions of exponential sized families of k-independent sets
3. On the factorization of the complete uniform hypergraph
4. Bounds on the length of disjunctive codes
5. A survey of superimposed codes theory
6. Families of finite sets in which no set is covered by the union of two others
7. Families of finite sets in which no set is covered by the union of r others
8. On Sperner Families satisfying an additional condition
9. Colored packing of sets
10. Near perfect coverings in graphs and hypergraphs
11. Information Theory and Reliable Communication
12. A method for detecting all defective members in a population by group testing
13. Non adaptive hypergeometric group testing
14. On the upper bounds for unrestricted binary error-correcting codes
15. Improved asymptotic bounds for error-correcting codes
16. A new upper bound for error-correcting codes
17. Nonrandom binary superimposed codes
18. On a packing and covering problem
19. An additive problem in different structures