A novel use of t-packings to construct d-disjunct matrices
From MaRDI portal
Publication:2499596
Recommendations
- A simple construction of \(d\)-disjunct matrices with certain constant weights
- On the upper bounds of the minimum number of rows of disjunct matrices
- Some properties of Macula's matrix and its complement
- A class of \(d\)-disjunct matrices constructed by subspaces
- scientific article; zbMATH DE number 7113430
Cites work
- scientific article; zbMATH DE number 3683607 (Why is no real title available?)
- scientific article; zbMATH DE number 3783018 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
- Families of finite sets in which no set is covered by the union of \(r\) others
- Nonrandom binary superimposed codes
- On a packing and covering problem
Cited in
(6)- A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters
- Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2
- New Construction of Error-Tolerant Pooling Designs
- Some properties of Macula's matrix and its complement
- The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
- A construction of \(d^z\)-disjunct matrices in a dual space of symplectic space
This page was built for publication: A novel use of \(t\)-packings to construct \(d\)-disjunct matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2499596)