Two new error-correcting pooling designs from d-bounded distance-regular graphs

Xinlu Zhang, Jun Guo and Suogang Gao ()
Additional contact information
Xinlu Zhang: Hebei Normal University
Jun Guo: Langfang Teachers’ College
Suogang Gao: Hebei Normal University

Journal of Combinatorial Optimization, 2009, vol. 17, issue 3, No 6, 339-345

Abstract: Abstract Let Γ be a d-bounded distance-regular graph with diameter d≥2. In this paper, we construct two new classes of error-correcting pooling designs from the posets consisting of the subspaces of Γ.

Keywords: Pooling designs; s e -disjunct matrix; Distance-regular graph; Strongly closed subgraphs (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9115-z 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:17:y:2009:i:3:d:10.1007_s10878-007-9115-z

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

DOI: 10.1007/s10878-007-9115-z

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 ().