Consider a collection of objects, some of which may be “bad,” and a test which determines whether or not a given subcollection contains no bad objects. The nonadaptive pooling (or group testing) problem involves identifying the bad objects using the least number of tests applied in parallel. The “hypergeometric” case occurs when an upper bound on the number of bad objects is knowna priori. Here, practical considerations lead us to impose the additional requirement ofa posterioriconfirmation that the bound is satisfied. A generalization of the problem in which occasional errors in the test outcomes can occur is also considered. Optimal solutions to the general problem are shown to be equivalent to maximum-size collections of subsets of a finite set satisfying a union condition which generalizes that considered by Erdo?s and co-workers. Lower bounds on the number of tests required are derived when the number of bad objects is believed to be either 1 or 2. Steiner systems are shown to be optimal solutions in some cases.
[1]
Zoltán Füredi,et al.
Families of Finite Sets in Which No Set Is Covered by the Union of Two Others
,
1982,
J. Comb. Theory, Ser. A.
[2]
E. Sperner.
Ein Satz über Untermengen einer endlichen Menge
,
1928
.
[3]
Damaraju Raghavarao,et al.
New combinatorial designs and their applications to group testing
,
1984
.
[4]
Jack K. Wolf,et al.
Born again group testing: Multiaccess communications
,
1985,
IEEE Trans. Inf. Theory.
[5]
D. Lubell.
A Short Proof of Sperner’s Lemma
,
1966
.
[6]
Miklós Ruszinkó,et al.
On the Upper Bound of the Size of the R-Cover-Free Families
,
1993,
Proceedings. IEEE International Symposium on Information Theory.