New constructions of non-adaptive and error-tolerance pooling designs

Citations of this article
Mendeley users who have this article in their library.


We propose two new classes of non-adaptive pooling designs. The first one is guaranteed to be rf-error-detecting and thus [d/2] -error-correcting, where d, a positive integer, is the maximum number of defectives (or positives). Hence, the number of errors which can be detected grows linearly with the number of positives. Also, this construction induces a construction of a binary code with minimum Hamming distance of at least 2d+2. The second design is the q-analogue of a known construction on d-disjunct matrices. ©2002 Elsevier Science B.V. All rights reserved.




Ngo, H. Q., & Du, D. Z. (2002). New constructions of non-adaptive and error-tolerance pooling designs. Discrete Mathematics, 243(1–3), 161–170.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free