On r-cover-free families
From MaRDI portal
Publication:1906129
DOI10.1006/JCTA.1996.0012zbMATH Open0843.05100OpenAlexW2012584108MaRDI QIDQ1906129FDOQ1906129
Authors: Zoltán Füredi
Publication date: 13 May 1996
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1996.0012
Cited In (40)
- Uniform hypergraphs containing no grids
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
- New Construction of Error-Tolerant Pooling Designs
- Coding for a Multiple Access OR Channel: a Survey
- Lower bounds for cover-free families
- Tracing a single user
- Generalized cover-free families.
- Codes identifying sets of vertices in random networks
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Binary representations of underdetermined data and superimposed codes
- On Cancellative Set Families
- Distributed broadcast in radio networks of unknown topology.
- Some new bounds for cover-free families
- On detecting some defective items in group testing
- Efficiently decodable error-correcting list disjunct matrices and applications (extended abstract)
- Sampling schemes and recovery algorithms for functions of few coordinate variables
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- Spanoids -- an abstraction of spanning structures, and a barrier for LCCs
- Exact learning from an honest teacher that answers membership queries
- Bounds for the number of tests in non-adaptive randomized algorithms for group testing
- Mutual inhibition with few inhibitory cells via nonlinear inhibitory synaptic interaction
- A survey of cover-free families: constructions, applications, and generalizations
- On the upper bounds of the minimum number of rows of disjunct matrices
- On the complexity of neighbourhood learning in radio networks
- Structure-aware combinatorial group testing: a new method for pandemic screening
- Optimal Message-Passing with Noisy Beeps
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Nested cover-free families for unbounded fault-tolerant aggregate signatures
- Some new bounds for cover-free families through biclique covers
- Title not available (Why is that?)
- Bounds and algorithms for generalized superimposed codes
- Coding for a multiple access OR channel: A survey
- Deterministic M2M multicast in radio networks
- Almost separable matrices
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
- Linear Time Constructions of Some $$d$$-Restriction Problems
- General theory of information transfer: Updated
- Almost optimal cover-free families
- Modification tolerant signature schemes: location and correction
- 2-cancellative hypergraphs and codes
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)