A simple construction of d-disjunct matrices with certain constant weights
Discrete Mathematics
Error-correcting nonadaptive group testing with de-disjunct matrices
Discrete Applied Mathematics
On error-tolerant DNA screening
Discrete Applied Mathematics
Error-correcting pooling designs associated with some distance-regular graphs
Discrete Applied Mathematics
| Hi-index | 0.05 |
We show that Macula's claim of a Hamming distance 4 between any two candidate sets of positive clones in his pool design is incorrect. However, a previous proof of his on a weaker result (with a condition on design parameters) is correct. We also show that the condition is sharp and the distance 4 result is also sharp for arbitrary parameter values.