Improved constructions for non-adaptive threshold group testing
From MaRDI portal
Publication:378256
DOI10.1007/s00453-013-9754-7zbMath1311.68186arXiv1002.2244OpenAlexW2570531678MaRDI QIDQ378256
Publication date: 11 November 2013
Published in: Algorithmica, Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.2244
Analysis of algorithms and problem complexity (68Q25) Other designs, configurations (05B30) Fault detection; testing in circuits and networks (94C12) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20)
Related Items (7)
Exact learning from an honest teacher that answers membership queries ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Threshold group testing with consecutive positives ⋮ Threshold and Majority Group Testing ⋮ Superimposed Codes and Threshold Group Testing ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ Subquadratic non-adaptive threshold group testing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved constructions for non-adaptive threshold group testing
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- Nonadaptive algorithms for threshold group testing
- Probabilistic nonadaptive group testing in the presence of errors and DNA library screening
- On the upper bound of the size of the \(r\)-cover-free families
- Generalized cover-free families.
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Some new bounds for cover-free families
- Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
- On error-tolerant DNA screening
- Noise-Resilient Group Testing: Limitations and Constructions
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Explicit Non-adaptive Combinatorial Group Testing Schemes
- k-Mismatch with Don’t Cares
- Randomness conductors and constant-degree lossless expanders
- Combinatorial Algorithms for Compressed Sensing
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Born again group testing: Multiaccess communications
- On optimal superimposed codes
- New constructions of superimposed codes
- Constructing Small-Bias Sets from Algebraic-Geometric Codes
- Nonrandom binary superimposed codes
- Threshold Group Testing
- Introduction to Coding Theory
This page was built for publication: Improved constructions for non-adaptive threshold group testing
