Noise-resilient group testing: limitations and constructions
From MaRDI portal
Publication:1759866
DOI10.1016/J.DAM.2012.07.022zbMath1253.68256arXiv1010.0433OpenAlexW2569988392MaRDI QIDQ1759866
Publication date: 22 November 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.0433
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (4)
Exact learning from an honest teacher that answers membership queries ⋮ Simple Codes and Sparse Recovery with Fast Decoding ⋮ On a theorem of Razborov ⋮ Optimal deterministic group testing algorithms to estimate the number of defectives
This page was built for publication: Noise-resilient group testing: limitations and constructions