Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-22T04:16:27.580Z Has data issue: false hasContentIssue false
  • English
  • Français

An Improvement Over the Information Lower Bound in Binomial Group Testing

Published online by Cambridge University Press:  27 July 2009

Y.C. Yao
Y.C. Yao
Affiliation:
Department of StatisticsColorado State University, Fort Collins, Colorado 80523
Get access Rights & Permissions [Opens in a new window]

Abstract

The group-testing problem for a binomial set of items is considered. It is desired to classify all items as good or defective with a minimum expected number of group tests. An improvement over the information lower bound, via a weak concavity property, is made for the minimum expected number of group tests.

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 2 , Issue 3 , July 1988 , pp. 313 - 320
Copyright
Copyright © Cambridge University Press 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Berger, T., Mehravari, N., Towsley, D., & Wolf, J. (1984). Random multiple-access communication and group testing. IEEE Transactions on Communication C-34: 769–779.Google Scholar
Sobel, M. & Groll, P.A. (1959). Group testing to eliminate efficiently all defectives in a binomial sample. Bell System Technical Journal 38: 1179–1252.Google Scholar
Ungar, P. (1960). The cut-off point in group testing. Communication on Pure and Applied Mathematics 13: 49–54.Google Scholar
Yao, Y.C. & Hwang, F.K. (1988). Individual testing of independent items in optimal group testing. Probability in Engineering and Informational Sciences 2: 23–29.Google Scholar