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

AbstractMotivated by the pooling designs over the incidence matrices of matchings with various sizes of the complete graph K2n 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 Jq(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