Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms

DOI10.1109/TIT.2014.2310477zbMath1360.62070arXiv1202.0206MaRDI QIDQ2986417

Samar Agnihotri, Venkatesh Saligrama, Sidharth Jaggi, Chun Lam Chan

Publication date: 16 May 2017

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

Full work available at URL: https://arxiv.org/abs/1202.0206

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Paired and multiple comparisons; multiple testing (62J15) Source coding (94A29)

Related Items (6)

Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing ⋮ Random and quasi-random designs in group testing ⋮ Unnamed Item ⋮ Almost separable matrices ⋮ Sampling schemes and recovery algorithms for functions of few coordinate variables ⋮ Unnamed Item

This page was built for publication: Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms