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 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 language | English |
---|---|
Journal | Dagstuhl Seminar Proceedings |
Volume | 9281 |
State | Published - 2009 |
Event | Search Methodologies 2009 - Wadern, Germany Duration: 5 Jul 2009 → 10 Jul 2009 |
Bibliographical note
Publisher Copyright:© 2009 Dagstuhl Seminar Proceedings. All rights reserved.