Performance of Group Testing Algorithms With Near-Constant Tests Per Item

DOI10.1109/TIT.2018.2861772zbMath1428.62100DBLPjournals/tit/JohnsonAS19arXiv1612.07122WikidataQ60522077 ScholiaQ60522077MaRDI QIDQ4615335

Jonathan Scarlett, Matthew Aldridge, Oliver Johnson

Publication date: 28 January 2019

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

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

zbMATH Keywords

test designnonadaptive group testingcomparison with Bernoulli designs

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Parametric hypothesis testing (62F03)

Related Items (5)

Optimal group testing ⋮ Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing ⋮ Generalized framework for group testing: queries, feedbacks and adversaries ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Performance of Group Testing Algorithms With Near-Constant Tests Per Item