A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters
From MaRDI portal
Publication:1045094
DOI10.1016/j.disc.2009.05.001zbMath1292.05067OpenAlexW1979991843MaRDI QIDQ1045094
Xiang-Hui Zhao, Yu-Qin Yang, Geng Sheng Zhang
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.001
Related Items (2)
Erasure combinatorial batch codes based on nonadaptive group testing ⋮ Group testing with geometry of classical groups over finite fields
Cites Work
- Unnamed Item
- A simple construction of \(d\)-disjunct matrices with certain constant weights
- On Macula's error-correcting pool designs.
- Trivial two-stage group testing for complexes using almost disjunct matrices.
- Pooling spaces and non-adaptive pooling designs
- On error-tolerant DNA screening
- 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: A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters