On the upper bound of the size of the \(r\)-cover-free families
From MaRDI portal
Publication:1328402
DOI10.1016/0097-3165(94)90067-1zbMath0798.05071OpenAlexW2004227827MaRDI QIDQ1328402
Publication date: 20 October 1994
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(94)90067-1
Related Items (43)
2-Cancellative Hypergraphs and Codes ⋮ Improved algorithms for group testing with inhibitors ⋮ Lower bounds for cover-free families ⋮ On the extremal combinatorics of the Hamming space ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Secure overlay network design ⋮ Tracing a single user ⋮ Secret sharing schemes with partial broadcast channels ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Equal-Weight Fingerprinting Codes ⋮ Codes identifying sets of vertices in random networks ⋮ Structure-aware combinatorial group testing: a new method for pandemic screening ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Two new perspectives on multi-stage group testing ⋮ Uniform hypergraphs containing no grids ⋮ On the complexity of neighbourhood learning in radio networks ⋮ Constructions for key distribution patterns ⋮ Locating and detecting arrays for interaction faults ⋮ Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis ⋮ Bounds and algorithms for generalized superimposed codes ⋮ Unnamed Item ⋮ Optimal Message-Passing with Noisy Beeps ⋮ Smart elements in combinatorial group testing problems with more defectives ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Generalized cover-free families. ⋮ Some intriguing upper bounds for separating hash families ⋮ Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing ⋮ Some new bounds for cover-free families ⋮ General theory of information transfer: Updated ⋮ Coding for a multiple access OR channel: A survey ⋮ Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications ⋮ Transport schemes for topology-transparent scheduling ⋮ Almost separable matrices ⋮ New Construction of Error-Tolerant Pooling Designs ⋮ Some new bounds for cover-free families through biclique covers ⋮ Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ On the upper bounds of the minimum number of rows of disjunct matrices ⋮ Unnamed Item ⋮ A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families ⋮ Coding for a Multiple Access OR Channel: a Survey
Cites Work
- On a packing and covering problem
- Families of finite sets in which no set is covered by the union of \(r\) others
- Explicit construction of exponential sized families of k-independent sets
- Near perfect coverings in graphs and hypergraphs
- Families of finite sets in which no set is covered by the union of two others
- On Sperner families satisfying an additional condition
- Improved asymptotic bounds for error-correcting codes
- Nonrandom binary superimposed codes
- On upper bounds for unrestricted binary-error-correcting codes
- A Method for Detecting All Defective Members in a Population by Group Testing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the upper bound of the size of the \(r\)-cover-free families
