Finding a Single Defective in Binomial Group-Testing.

The problem of finding a single defective item from an infinite binomial population is considered when group-testing is possible, i.e., when we can test any number of units x simultaneously and find out in one test if oil x are good or if at least one of the x is defective. An optimal procedure is obtained in the sense that it minimizes the expected number of tests required to find one defective. Upper and lower bounds are derived using information theory and the relation of our procedure to the Huffman algorithm and the corresponding cost is studied. [ABSTRACT FROM AUTHOR]