New constructions of non-adaptive and error-tolerance pooling designs Original Research Article

We propose two new classes of non-adaptive pooling designs. The first one is guaranteed to be d-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.