A simple construction of \(d\)-disjunct matrices with certain constant weights
From MaRDI portal
Publication:1356684
DOI10.1016/0012-365X(95)00296-9zbMath0870.05012OpenAlexW1990807929MaRDI QIDQ1356684
Publication date: 15 September 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(95)00296-9
Related Items (45)
Error-correcting pooling designs associated with the dual space of unitary space and ratio efficiency comparison ⋮ Two applications of separating systems to nonadaptive procedures ⋮ Random and quasi-random designs in group testing ⋮ Simplified searching for two defects ⋮ New error-correcting pooling designs with vector spaces over finite field ⋮ New error-correcting pooling designs associated with finite vector spaces ⋮ Synthetic sequence design for signal location search ⋮ Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices ⋮ Uniform hypergraphs containing no grids ⋮ 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 ⋮ On Macula's error-correcting pool designs. ⋮ A generalization of Macula's disjunct matrices ⋮ A generalization of the formulas for intersection numbers of dual polar association schemes and their applications ⋮ On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design ⋮ Anzahl formulas of subspaces in symplectic spaces and their applications ⋮ Improvements on some error-tolerance pooling designs ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Error-tolerance pooling designs based on Johnson graphs ⋮ Nested cover-free families for unbounded fault-tolerant aggregate signatures ⋮ Pooling spaces associated with finite geometry ⋮ A construction of \(d^z\)-disjunct matrices in a dual space of symplectic space ⋮ New Construction of Error-Tolerant Pooling Designs ⋮ Error-correcting pooling designs associated with some distance-regular graphs ⋮ A construction of pooling designs with surprisingly high degree of error correction ⋮ Pooling designs with surprisingly high degree of error correction in a finite vector space ⋮ On error-tolerant DNA screening ⋮ Pooling designs associated with unitary space and ratio efficiency comparison ⋮ New construction of error-correcting pooling designs from singular linear spaces over finite fields ⋮ Two error-correcting pooling designs from symplectic spaces over a finite field ⋮ Optimal superimposed codes and designs for Renyi's search model ⋮ More on pooling spaces ⋮ Two new error-correcting pooling designs from \(d\)-bounded distance-regular graphs ⋮ Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix ⋮ Construction of error-tolerance pooling designs in symplectic spaces ⋮ PCR NONADAPTIVE GROUP TESTING OF DNA LIBRARIES FOR BIOMOLECULAR COMPUTING AND TAGGANT APPLICATIONS ⋮ Group testing with geometry of classical groups over finite fields ⋮ Pooling spaces and non-adaptive pooling designs ⋮ A NEW CONSTRUCTION FOR POOLING DESIGNS ⋮ A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters ⋮ Probabilistic nonadaptive group testing in the presence of errors and DNA library screening
Cites Work
This page was built for publication: A simple construction of \(d\)-disjunct matrices with certain constant weights
