A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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[r 2 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 adoi:10.1109/tit.2011.2163296 fatcat:vcnrtzt7qneybiam6wawtwt32i