AbstractA superimposed code with general distance D can be used to construct a non-adaptive pooling design. It can then be used to identify a few unknown positives from a large set of items by associating naturally an outcome vector u. A simple method for decoding the outcome vector u is given whenever there are at most
$$\frac{{D - 1}}{2}$$
errors occuring in the outcome vector u. Moreover, another simple method of detecting whether there is any error occuring in the outcome vector u is also given whenever there are at most D − 1 errors in u. Our method is a generalization of the classical result of Kautz and Singleton (Nonadaptive binary superimposed codes, IEEE Trans. Inform. Theory, vol. 10, pp. 363–377, 1964).
[1]
Ding-Zhu Du,et al.
New constructions of non-adaptive and error-tolerance pooling designs
,
2002,
Discret. Math..
[2]
D. Du,et al.
Combinatorial Group Testing and Its Applications
,
1993
.
[3]
Tayuan Huang,et al.
Pooling spaces and non-adaptive pooling designs
,
2004,
Discret. Math..
[4]
Anthony J. Macula,et al.
A simple construction of d-disjunct matrices with certain constant weights
,
1996,
Discret. Math..
[5]
V. V. Rykov,et al.
Superimposed distance codes
,
1989
.
[6]
Richard C. Singleton,et al.
Nonrandom binary superimposed codes
,
1964,
IEEE Trans. Inf. Theory.