Explicit Non-Adaptive Combinatorial Group Testing Schemes

Ely Porat, Amir Rothschild

Research output: Contribution to journalConference articlepeer-review


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 log 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
JournalDagstuhl Seminar Proceedings
StatePublished - 2009
EventSearch Methodologies 2009 - Wadern, Germany
Duration: 5 Jul 200910 Jul 2009

Bibliographical note

Publisher Copyright:
© 2009 Dagstuhl Seminar Proceedings. All rights reserved.


Dive into the research topics of 'Explicit Non-Adaptive Combinatorial Group Testing Schemes'. Together they form a unique fingerprint.

Cite this