Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
From MaRDI portal
Publication:696905
DOI10.1006/jcta.2002.3257zbMath1020.94027OpenAlexW2009085022MaRDI QIDQ696905
Anthony J. Macula, David C. Torney, Arkadii G. D'yachkov, Pavel A. Vilenkin
Publication date: 12 September 2002
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.2002.3257
Partitions of sets (05A18) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Bounds on codes (94B65) Combinatorial codes (94B25)
Related Items (34)
Almost cover-free codes ⋮ A group testing method for finding patterns in data ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Non-adaptive complex group testing with multiple positive sets ⋮ Separating codes and a new combinatorial search model ⋮ On the complexity of neighbourhood learning in radio networks ⋮ Hypothesis group testing for disjoint pairs ⋮ A survey on nonadaptive group testing algorithms through the angle of decoding ⋮ New combinatorial structures with applications to efficient group testing with inhibitors ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ A note on the uniqueness of \((w, r)\) cover-free codes ⋮ Non-adaptive learning of a hidden hypergraph ⋮ Asymptotic bounds for the rate of colored superimposed codes ⋮ Smart elements in combinatorial group testing problems with more defectives ⋮ Uniqueness of some optimal superimposed codes ⋮ Strict group testing and the set basis problem ⋮ Pooling spaces associated with finite geometry ⋮ An upper bound of the number of tests in pooling designs for the error-tolerant complex model ⋮ Non-adaptive Complex Group Testing with Multiple Positive Sets ⋮ Cover-free codes and separating system codes ⋮ Almost cover-free codes and designs ⋮ Transport schemes for topology-transparent scheduling ⋮ An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution ⋮ Bounds on the rate of separating codes ⋮ Threshold and Majority Group Testing ⋮ Superimposed Codes and Threshold Group Testing ⋮ Some new bounds for cover-free families through biclique covers ⋮ Bounds on the rate of disjunctive codes ⋮ A class of error-correcting pooling designs over complexes ⋮ Nonadaptive algorithms for threshold group testing ⋮ Non-adaptive Learning of a Hidden Hypergraph ⋮ Almost disjunctive list-decoding codes
Cites Work
- Families of finite sets in which no set is covered by the union of \(r\) others
- Families of finite sets in which no set is covered by the union of two others
- On the upper bound of the size of the \(r\)-cover-free families
- On \(r\)-cover-free families
- Some new bounds for cover-free families
- Interval Packing and Covering in the Boolean Lattice
- New constructions of superimposed codes
- Nonrandom binary superimposed codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
