A simple construction of d-disjunct matrices with certain constant weights
Discrete Mathematics
D-bounded distance-regular graphs
European Journal of Combinatorics
Error-correcting nonadaptive group testing with de-disjunct matrices
Discrete Applied Mathematics
New constructions of non-adaptive and error-tolerance pooling designs
Discrete Mathematics
Lattices generated by strongly closed subgraphs in d-bounded distance-regular graphs
European Journal of Combinatorics
Nonrandom binary superimposed codes
IEEE Transactions on Information Theory
Error-correcting pooling designs associated with some distance-regular graphs
Discrete Applied Mathematics
DNA library screening, pooling design and unitary spaces
Theoretical Computer Science
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
| Hi-index | 0.00 |
Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing algorithms with applications to DNA library screening, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 55 (2000) 171-182], the notion of pooling spaces was introduced [T. Huang, C. Weng, Pooling spaces and non-adaptive pooling designs, Discrete Mathematics 282 (2004) 163-169] for a systematic way of constructing pooling designs; note that geometric lattices are among pooling spaces. This paper attempts to draw possible connections from finite geometry and distance regular graphs to pooling spaces: including the projective spaces, the affine spaces, the attenuated spaces, and a few families of geometric lattices associated with the orbits of subspaces under finite classical groups, and associated with d-bounded distance-regular graphs.