Optimal Multistage Group Testing Algorithm for 3 Defectives

Ilya Vorobyev

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Group testing is a well-known search problem that consists in detecting of s defective members of a set of t samples by carrying out tests on properly chosen subsets of samples. In classical group testing the goal is to find all defective elements by using the minimal possible number of tests in the worst case. In this work, a multistage group testing problem is considered. Our goal is to construct a multistage search procedure, having asymptotically the same number of tests as the optimal adaptive algorithm. We propose a new approach to designing multistage algorithms, which allows us to construct a 5-stage algorithm for finding 3 defectives with the optimal number 3log2t(1 + o(1) of tests.A full version of this paper is accessible at [1]

Original languageEnglish
Title of host publication2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages90-95
Number of pages6
ISBN (Electronic)9781728164328
DOIs
Publication statusPublished - Jun 2020
Event2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States
Duration: 21 Jul 202026 Jul 2020

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2020-June
ISSN (Print)2157-8095

Conference

Conference2020 IEEE International Symposium on Information Theory, ISIT 2020
Country/TerritoryUnited States
CityLos Angeles
Period21/07/2026/07/20

Fingerprint

Dive into the research topics of 'Optimal Multistage Group Testing Algorithm for 3 Defectives'. Together they form a unique fingerprint.

Cite this