You are not currently logged in.
Access JSTOR through your library or other institution:
Finding a Single Defective in Binomial Group-Testing
Satindar Kumar and Milton Sobel
Journal of the American Statistical Association
Vol. 66, No. 336 (Dec., 1971), pp. 824-828
Stable URL: http://www.jstor.org/stable/2284234
Page Count: 5
You can always find the topics here!Topics: Mathematical procedures, Binomials, Integers, Mathematical problems, Binary codes, Cost efficiency, Information theory, Mathematical tables
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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 all 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.
Journal of the American Statistical Association © 1971 American Statistical Association