The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design

DOI10.1007/s10878-008-9199-0zbMath1228.90102OpenAlexW2034399496MaRDI QIDQ711399

Yu-Qin Yang, Geng Sheng Zhang

Publication date: 26 October 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9199-0

zbMATH Keywords

orthogonal space\(d^{z}\)-disjunctarrangement problemtest efficiencytighter analysis

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Trivial two-stage group testing for complexes using almost disjunct matrices.
• Pooling spaces and non-adaptive pooling designs
• On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design
• A novel use of \(t\)-packings to construct \(d\)-disjunct matrices
• New constructions of non-adaptive and error-tolerance pooling designs

This page was built for publication: The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design