Explicit Nonadaptive Combinatorial Group Testing Schemes

DOI10.1109/TIT.2011.2163296zbMath1365.94695OpenAlexW2096573287MaRDI QIDQ5272213

Ely Porat, Amir Rothschild

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2011.2163296

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12)

Related Items (21)

Almost Optimal Cover-Free Families ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Structure-aware combinatorial group testing: a new method for pandemic screening ⋮ Real-valued group testing for quantitative molecular assays ⋮ Modification tolerant signature schemes: location and correction ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ $$\epsilon $$-Almost Selectors and Their Applications ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ The design of (almost) disjunct matrices by evolutionary algorithms ⋮ On the complexity of neighbourhood learning in radio networks ⋮ Bounds and algorithms for generalized superimposed codes ⋮ Unnamed Item ⋮ Nested cover-free families for unbounded fault-tolerant aggregate signatures ⋮ Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Unnamed Item ⋮ Subquadratic non-adaptive threshold group testing ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Optimal channel utilization with limited feedback ⋮ Sampling schemes and recovery algorithms for functions of few coordinate variables ⋮ Locating modifications in signed data for partial data integrity

This page was built for publication: Explicit Nonadaptive Combinatorial Group Testing Schemes