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

Geng-Sheng Zhang () and Yu-Qin Yang
Additional contact information
Geng-Sheng Zhang: Hebei Normal University
Yu-Qin Yang: Hebei Normal University

Journal of Combinatorial Optimization, 2010, vol. 20, issue 2, No 3, 142-160

Abstract: Abstract In this paper, we construct a d z -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; d z -disjunct; Arrangement problem; Tighter analysis; Test efficiency (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-008-9199-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:20:y:2010:i:2:d:10.1007_s10878-008-9199-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-008-9199-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().