Pooling spaces and non-adaptive pooling designs
From MaRDI portal
Publication:1827741
DOI10.1016/j.disc.2003.11.004zbMath1045.06001OpenAlexW2049554346MaRDI QIDQ1827741
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.004
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorics of partially ordered sets (06A07) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (32)
Error-correcting pooling designs associated with the dual space of unitary space and ratio efficiency comparison ⋮ New error-correcting pooling designs with vector spaces over finite field ⋮ New error-correcting pooling designs associated with finite vector spaces ⋮ Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2 ⋮ Constructing error-correcting pooling designs with symplectic space ⋮ Pooling semilattices and non-adaptive pooling designs ⋮ Erasure combinatorial batch codes based on nonadaptive group testing ⋮ Approaching pooling design with smaller efficient ratio ⋮ DNA library screening, pooling design and unitary spaces ⋮ A generalization of Macula's disjunct matrices ⋮ A generalization of the formulas for intersection numbers of dual polar association schemes and their applications ⋮ Deterministic construction of compressed sensing matrices based on semilattices ⋮ Singular linear space and its applications ⋮ Error-tolerance pooling designs based on Johnson graphs ⋮ Pooling spaces associated with finite geometry ⋮ A construction of \(d^z\)-disjunct matrices in a dual space of symplectic space ⋮ A new construction of \(\bar 3\)-separable matrices via an improved decoding of Macula's construction ⋮ Error-correcting pooling designs associated with some distance-regular graphs ⋮ A construction of pooling designs with surprisingly high degree of error correction ⋮ The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design ⋮ Pooling designs with surprisingly high degree of error correction in a finite vector space ⋮ A class of error-correcting pooling designs over complexes ⋮ Pooling designs associated with unitary space and ratio efficiency comparison ⋮ Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields ⋮ Two error-correcting pooling designs from symplectic spaces over a finite field ⋮ More on pooling spaces ⋮ Two new error-correcting pooling designs from \(d\)-bounded distance-regular graphs ⋮ Lattices generated by subspaces in \(d\)-bounded distance-regular graphs ⋮ ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES ⋮ Group testing with geometry of classical groups over finite fields ⋮ A NEW CONSTRUCTION FOR POOLING DESIGNS ⋮ A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(D\)-bounded distance-regular graphs
- A characterization of the association schemes of bilinear forms
- Association schemes and t-designs in regular semilattices
- Probabilistic nonadaptive group testing in the presence of errors and DNA library screening
- A simple construction of \(d\)-disjunct matrices with certain constant weights
- Nonrandom binary superimposed codes
- New constructions of non-adaptive and error-tolerance pooling designs
This page was built for publication: Pooling spaces and non-adaptive pooling designs
