Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices

From MaRDI portal
Publication:1382279


DOI10.1016/S0166-218X(97)80002-9zbMath0902.94030MaRDI QIDQ1382279

Anthony J. Macula

Publication date: 13 December 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam



Related Items

The identification of positive clones in a general inhibitor model, Random and quasi-random designs in group testing, New error-correcting pooling designs associated with finite vector spaces, Constructing error-correcting pooling designs with symplectic space, Pooling semilattices and non-adaptive pooling designs, Probabilistic existence theorems in group testing, On Macula's error-correcting pool designs., A generalization of Macula's disjunct matrices, On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design, Bounds and algorithms for generalized superimposed codes, Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels., Pooling spaces associated with finite geometry, 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, Nonadaptive group testing with lies: probabilistic existence theorems, On error-tolerant DNA screening, A novel use of \(t\)-packings to construct \(d\)-disjunct matrices, A class of error-correcting pooling designs over complexes, Pooling designs associated with unitary space and ratio efficiency comparison, Low-weight superimposed codes and related combinatorial structures: bounds and applications, 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, The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks, Construction of error-tolerance pooling designs in symplectic spaces, On the upper bounds of the minimum number of rows of disjunct matrices, Group testing with geometry of classical groups over finite fields, A NEW CONSTRUCTION FOR POOLING DESIGNS, Probabilistic nonadaptive group testing in the presence of errors and DNA library screening



Cites Work