The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
From MaRDI portal
(Redirected from Publication:711399)
Recommendations
- An arrangement problem of subspaces of the symplectic space and the tighter bound of an error-tolerant pooling design
- Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2
- Arrangement problem on the subspaces of the unitary space and a \(d^z\)-disjunct matrix with correction capability
- New Construction of Error-Tolerant Pooling Designs
- A pooling design with singular linear space and its tighter bound
Cites work
- A novel use of \(t\)-packings to construct \(d\)-disjunct matrices
- New constructions of non-adaptive and error-tolerance pooling designs
- On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design
- Pooling spaces and non-adaptive pooling designs
- Trivial two-stage group testing for complexes using almost disjunct matrices.
Cited in
(4)- Arrangement problem on the subspaces of the unitary space and a \(d^z\)-disjunct matrix with correction capability
- Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2
- An arrangement problem of subspaces of the symplectic space and the tighter bound of an error-tolerant pooling design
- On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design
This page was built for publication: The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711399)
