An arrangement problem of subspaces of the symplectic space and the tighter bound of an error-tolerant pooling design

zbMATH Open1265.05084MaRDI QIDQ4901923FDOQ4901923

Authors: Xianghui Zhao, Li Li, Gengsheng Zhang 

Publication date: 24 January 2013

Recommendations

• The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
• Two error-correcting pooling designs from symplectic spaces over a finite field
• Arrangement problem on the subspaces of the unitary space and a \(d^z\)-disjunct matrix with correction capability
• A family of pooling designs by subspaces of a pseudo-symplectic space and the tight bounds of their error-correcting capability
• Construction of error-tolerance pooling designs in symplectic spaces

zbMATH Keywords

symplectic spacepooling designarrangement problem\(d^z\)-disjuncttighter bounds

Mathematics Subject Classification ID

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

Cited In (7)

• Arrangement problem on the subspaces of the unitary space and a \(d^z\)-disjunct matrix with correction capability
• The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
• Title not available (Why is that?)
• Constructing error-correcting pooling designs with symplectic space
• A construction of \(d^z\)-disjunct matrices in a dual space of symplectic space
• A packing arrangement of subspaces of pseudo-symplectic space
• On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design

This page was built for publication: An arrangement problem of subspaces of the symplectic space and the tighter bound 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 Q4901923)