Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives

We study the problem of determining exactly the number of defective items in an adaptive Group testing by using a minimum number of tests. We improve the existing algorithm and prove a lower bound that shows that the number of tests in our algorithm is optimal up to small additive terms.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Bshouty, Nader H, Haddad-Zaknoon, Catherine A, Boulos, Raghd, Moalem, Foad, Nada, Jalal, Noufi, Elias, Zaknoon, Yara
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Information Theory Mathematics - Information Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We study the problem of determining exactly the number of defective items in an adaptive Group testing by using a minimum number of tests. We improve the existing algorithm and prove a lower bound that shows that the number of tests in our algorithm is optimal up to small additive terms.
DOI:	10.48550/arxiv.2001.00441