On r-cover-free families
From MaRDI portal
Cited in
(40)- On detecting some defective items in group testing
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- 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
- Spanoids -- an abstraction of spanning structures, and a barrier for LCCs
- 2-cancellative hypergraphs and codes
- Mutual inhibition with few inhibitory cells via nonlinear inhibitory synaptic interaction
- Some new bounds for cover-free families
- Uniform hypergraphs containing no grids
- Exact learning from an honest teacher that answers membership queries
- A survey of cover-free families: constructions, applications, and generalizations
- scientific article; zbMATH DE number 1462939 (Why is no real title available?)
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
- Almost optimal cover-free families
- Deterministic M2M multicast in radio networks
- Efficiently decodable error-correcting list disjunct matrices and applications (extended abstract)
- Tracing a single user
- Nested cover-free families for unbounded fault-tolerant aggregate signatures
- Bounds for the number of tests in non-adaptive randomized algorithms for group testing
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
- On the upper bounds of the minimum number of rows of disjunct matrices
- Optimal Message-Passing with Noisy Beeps
- Binary representations of underdetermined data and superimposed codes
- New Construction of Error-Tolerant Pooling Designs
- Bounds and algorithms for generalized superimposed codes
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Lower bounds for cover-free families
- Generalized cover-free families.
- On the complexity of neighbourhood learning in radio networks
- On Cancellative Set Families
- Sampling schemes and recovery algorithms for functions of few coordinate variables
- General theory of information transfer: Updated
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- Coding for a multiple access OR channel: A survey
- Codes identifying sets of vertices in random networks
- Modification tolerant signature schemes: location and correction
- Coding for a Multiple Access OR Channel: a Survey
- Almost separable matrices
- Distributed broadcast in radio networks of unknown topology.
- Structure-aware combinatorial group testing: a new method for pandemic screening
This page was built for publication: On \(r\)-cover-free families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906129)