Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms

DOI10.1109/TIT.2022.3141244zbMath1497.94205arXiv2004.11860OpenAlexW4226124449MaRDI QIDQ5088467

Nelvin Tan, Manuel Penschuck, Max Hahn-Klimroth, Maurice Rolvien, Jonathan Scarlett, Oliver Gebhard, Olaf Parczyk

Publication date: 13 July 2022

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

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

zbMATH Keywords

definite defectives (DD) algorithmrandom regular designsparsity-constrained group testing

Mathematics Subject Classification ID

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

Related Items (1)

Real-valued group testing for quantitative molecular assays

This page was built for publication: Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms