Constructing disjunction matrices with unitary space and analyzing the tighter bound

DOI10.3969/J.ISSN.1673-5862.2019.03.013MaRDI QIDQ5209905zbMATH OpenFDO

Authors Meifang Niu, Li-Hua Zhang

Publication date 22 January 2020

zbMATH Keywords

pooling designunitary spacetighter bound\({d^z}\)-disjunction matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of finite geometries (05B25)

Recommendations

• scientific article; zbMATH DE number 7366385
• Arrangement problem on the subspaces of the unitary space and a \(d^z\)-disjunct matrix with correction capability
• A construction of d^z-disjunct matrices in a dual space of symplectic space
• A \({d^z}\)-disjunct matrix based on totally isotropic subspaces of the symplectic space
• On the upper bounds of the minimum number of rows of disjunct matrices

Cited in

(2)

• scientific article; zbMATH DE number 7366385 (Why is no real title available?)
• scientific article; zbMATH DE number 7113430 (Why is no real title available?)

This page was built for publication: Constructing disjunction matrices with unitary space and analyzing the tighter bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5209905)