Error-correcting pooling designs associated with some distance-regular graphs

Authors:
Yujuan Bai;Tayuan Huang;Kaishun Wang
Affiliations:
Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal University, Beijing, 100875, China and Beijing DongFangDeCai School, Beijing, 100026, China;Department of Applied Mathematics, National Chiao-Tung University, Hsinchu, Taiwan;Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal University, Beijing, 100875, China
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 5
Cited 2

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
On Macula's error-correcting pool designs

Discrete Mathematics
Pooling spaces associated with finite geometry

European Journal of Combinatorics

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

Journal of Combinatorial Theory Series A
A generalization of Macula's disjunct matrices

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.05

Visualization

Abstract

Motivated by the pooling designs over the incidence matrices of matchings with various sizes of the complete graph K"2"n considered by Ngo and Du [Ngo and Du, Discrete Math. 243 (2003) 167-170], two families of pooling designs over the incidence matrices oft-cliques (resp. strongly t-cliques) with various sizes of the Johnson graph J(n,t) (resp. the Grassmann graph J"q(n,t)) are considered. Their performances as pooling designs are better than those given by Ngo and Du. Moreover, pooling designs associated with other special distance-regular graphs are also considered.