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 (31)

The identification of positive clones in a general inhibitor modelRandom and quasi-random designs in group testingNew error-correcting pooling designs associated with finite vector spacesConstructing error-correcting pooling designs with symplectic spacePooling semilattices and non-adaptive pooling designsProbabilistic existence theorems in group testingOn Macula's error-correcting pool designs.A generalization of Macula's disjunct matricesOn a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling designBounds and algorithms for generalized superimposed codesConstructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.Pooling spaces associated with finite geometryNew Construction of Error-Tolerant Pooling DesignsError-correcting pooling designs associated with some distance-regular graphsA construction of pooling designs with surprisingly high degree of error correctionPooling designs with surprisingly high degree of error correction in a finite vector spaceNonadaptive group testing with lies: probabilistic existence theoremsOn error-tolerant DNA screeningA novel use of \(t\)-packings to construct \(d\)-disjunct matricesA class of error-correcting pooling designs over complexesPooling designs associated with unitary space and ratio efficiency comparisonLow-weight superimposed codes and related combinatorial structures: bounds and applicationsMore on pooling spacesTwo new error-correcting pooling designs from \(d\)-bounded distance-regular graphsTransforming an error-tolerant separable matrix to an error-tolerant disjunct matrixThe minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranksConstruction of error-tolerance pooling designs in symplectic spacesOn the upper bounds of the minimum number of rows of disjunct matricesGroup testing with geometry of classical groups over finite fieldsA NEW CONSTRUCTION FOR POOLING DESIGNSProbabilistic nonadaptive group testing in the presence of errors and DNA library screening



Cites Work




This page was built for publication: Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices