A novel use of t-packings to construct d-disjunct matrices
From MaRDI portal
Publication:2499596
DOI10.1016/J.DAM.2006.03.009zbMATH Open1098.05017OpenAlexW1967059227MaRDI QIDQ2499596FDOQ2499596
Publication date: 14 August 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.009
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
Design of statistical experiments (62K99) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40)
Cites Work
- On a packing and covering problem
- Nonrandom binary superimposed codes
- Title not available (Why is that?)
- Families of finite sets in which no set is covered by the union of \(r\) others
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- New Construction of Error-Tolerant Pooling Designs
- The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
- Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2
- A construction of \(d^z\)-disjunct matrices in a dual space of symplectic space
- A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters
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)
