Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-24T21:50:04.473Z Has data issue: false hasContentIssue false
  • English
  • Français

An Improved Lower Bound on the Minimum Expected Number of Binomial Group Tests

Published online by Cambridge University Press:  27 July 2009

Julia Abrahams
Julia Abrahams
Affiliation:
Mathematical Sciences Division, Office of Naval Research, Arlington, Virginia 22217-5660
Get access Rights & Permissions [Opens in a new window]

Abstract

The minimum expected number of binomial group tests is lower bounded by the cost of a particular Huffman coding problem whose solution is known. Thus, the information lower bound in binomial group testing is improved when the probability that each item is defective is small.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 7 , Issue 1 , January 1993 , pp. 121 - 124
Copyright
Copyright © Cambridge University Press 1993

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

1.Huffman, D.A. (1952). A method for the construction of minimum redundancy codes. Proceedings of IRE (Institute of Radio Engineers) 40: 1098–1101.Google Scholar
2.Jakobsson, M. (1978). Huffman coding in bit-vector compression. Information Processing Letters 7: 304–307.CrossRefGoogle Scholar
3.Sobel, M. & Groll, P.A. (1959). Group testing to eliminate efficiently all defectives in a binomial sample. Bell System Technical Journal 38: 1179–1252.CrossRefGoogle Scholar
4.Ungar, P. (1960). The cut-off point in group testing. Communications on Pure and Applied Mathematics 13: 49–54.CrossRefGoogle Scholar
5.Yao, Y.C. (1988). An improvement over the information lower bound in binomial group testing. Probability in the Engineering and Informational Sciences 2: 313–320.CrossRefGoogle Scholar
6.Yao, Y.C. & Hwang, F.K. (1990). On optimal nested group testing algorithms. Journal of Statistical Planning and Inference 24: 167–175.CrossRefGoogle Scholar