Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives
Information Theory
2020-01-03 v1 math.IT
Abstract
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.
Cite
@article{arxiv.2001.00441,
title = {Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives},
author = {Nader H. Bshouty and Catherine A. Haddad-Zaknoon and Raghd Boulos and Foad Moalem and Jalal Nada and Elias Noufi and Yara Zaknoon},
journal= {arXiv preprint arXiv:2001.00441},
year = {2020}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1712.00615