Almost separable matrices
From MaRDI portal
Publication:512882
DOI10.1007/s10878-015-9951-1zbMath1367.90093arXiv1410.1826OpenAlexW3100593671MaRDI QIDQ512882
Leonardo Baldassini, Matthew Aldridge, Karen Gunderson
Publication date: 3 March 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.1826
cover-free familiesprobabilistic methodgroup testingdisjunct matricesseparable matricesunion-free families
Cites Work
- Unnamed Item
- Bounds on the length of disjunctive codes
- Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices
- On two random search problems
- The separating property of random matrices
- On the upper bound of the size of the \(r\)-cover-free families
- Probabilistic existence theorems in group testing
- Trivial two-stage group testing for complexes using almost disjunct matrices.
- On \(r\)-cover-free families
- Bounds on the rate of disjunctive codes
- Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework
- Group Testing Algorithms: Bounds and Simulations
- Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms
- Explicit Non-adaptive Combinatorial Group Testing Schemes
- Phase Transitions in Group Testing
- On Almost Disjunct Matrices for Group Testing
- Search for Sparse Active Inputs: A Review
- Boolean Compressed Sensing and Noisy Group Testing
- Nonrandom binary superimposed codes
- An extremal problem in graph theory