Sciweavers

JCO
2010

The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design

13 years 3 months ago
The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
In this paper, we construct a dz-disjunct matrix with the orthogonal spaces over finite fields of odd characteristic. We consider the arrangement problem of d (m−1,2(s −1),s −1)-subspaces and the tighter bounds for an error-tolerant pooling design. Moreover, we give the tighter analysis of our construction by the results of the arrangement problem. Additionally, by comparing our construction with the previous construction out of vector spaces, we find that our construction is better under some conditions. Keywords Orthogonal space · dz-disjunct · Arrangement problem · Tighter analysis · Test efficiency
Geng-sheng Zhang, Yu-qin Yang
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where JCO
Authors Geng-sheng Zhang, Yu-qin Yang
Comments (0)