On \(r\)-cover-free families
From MaRDI portal
Publication:1906129
DOI10.1006/jcta.1996.0012zbMath0843.05100OpenAlexW2012584108MaRDI QIDQ1906129
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
Related Items (38)
2-Cancellative Hypergraphs and Codes ⋮ Almost Optimal Cover-Free Families ⋮ Lower bounds for cover-free families ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Tracing a single user ⋮ Codes identifying sets of vertices in random networks ⋮ Structure-aware combinatorial group testing: a new method for pandemic screening ⋮ Modification tolerant signature schemes: location and correction ⋮ Uniform hypergraphs containing no grids ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ On the complexity of neighbourhood learning in radio networks ⋮ Distributed broadcast in radio networks of unknown topology. ⋮ Bounds and algorithms for generalized superimposed codes ⋮ Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs ⋮ Optimal Message-Passing with Noisy Beeps ⋮ Unnamed Item ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Generalized cover-free families. ⋮ Nested cover-free families for unbounded fault-tolerant aggregate signatures ⋮ 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 ⋮ 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 ⋮ On Cancellative Set Families ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Deterministic M2M multicast in radio networks ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Mutual Inhibition with Few Inhibitory Cells via Nonlinear Inhibitory Synaptic Interaction ⋮ Sampling schemes and recovery algorithms for functions of few coordinate variables ⋮ Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs ⋮ On the upper bounds of the minimum number of rows of disjunct matrices ⋮ Unnamed Item ⋮ Coding for a Multiple Access OR Channel: a Survey
This page was built for publication: On \(r\)-cover-free families
