A construction of pooling designs with surprisingly high degree of error correction

Authors:
Jun Guo;Kaishun Wang
Affiliations:
Math. and Inf. College, Langfang Teachers College, Langfang 065000, China;Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal University, Beijing 100875, China
Venue:
Journal of Combinatorial Theory Series A
Year:
2011

Citing 5
Cited 1

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
New constructions of non-adaptive and error-tolerance pooling designs

Discrete Mathematics
Pooling spaces associated with finite geometry

European Journal of Combinatorics
Error-correcting pooling designs associated with some distance-regular graphs

Discrete Applied Mathematics

Pooling designs with surprisingly high degree of error correction in a finite vector space

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is well known that many famous pooling designs are constructed from mathematical structures by the ''containment matrix'' method. In this paper, we propose another method and obtain a family of pooling designs with surprisingly high degree of error correction based on a finite set. Given the numbers of items and pools, the error-tolerant property of our designs is much better than that of Macula@?s designs when the size of the set is large enough.