Explicit non-adaptive combinatorial group testing schemes

Ely Porat, Amir Rothschild

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

71 Scopus citations

Abstract

Group testing is a long studied problem in combinatorics: A small set of r ill people should be identified out of the whole (n people) by using only queries (tests) of the form "Does set X contain an ill human?". In this paper we provide an explicit construction of a testing scheme which is better (smaller) than any known explicit construction. This scheme has Θ(min[r2 ln n, n]) tests which is as many as the best non-explicit schemes have. In our construction we use a fact that may have a value by its own right: Linear error-correction codes with parameters [m,k,δm]q meeting the Gilbert-Varshamov bound may be constructed quite efficiently, in Θ(qkm) time.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings
Pages748-759
Number of pages12
EditionPART 1
DOIs
StatePublished - 2008
Event35th International Colloquium on Automata, Languages and Programming, ICALP 2008 - Reykjavik, Iceland
Duration: 7 Jul 200811 Jul 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume5125 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference35th International Colloquium on Automata, Languages and Programming, ICALP 2008
Country/TerritoryIceland
CityReykjavik
Period7/07/0811/07/08

Fingerprint

Dive into the research topics of 'Explicit non-adaptive combinatorial group testing schemes'. Together they form a unique fingerprint.

Cite this