A class of error-correcting pooling designs over complexes

Tayuan Huang; Kaishun Wang; Chih-wen Weng

doi:10.1007/s10878-008-9179-4

A class of error-correcting pooling designs over complexes

Tayuan Huang, Kaishun Wang^*, Chih-wen Weng

^*Corresponding author for this work

Department of Applied Mathematics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

As a generalization of d ^e -disjunct matrices and (w,r;d)-cover-free-families, the notion of (s,l) ^e -disjunct matrices is introduced for error-correcting pooling designs over complexes (or set pooling designs). We show that (w,r,d)-cover-free-families form a class of (s,l) ^e -disjunct matrices. Moreover, a decoding algorithm for pooling designs based on (s,l) ^e -disjunct matrices is considered.

Original language	English
Pages (from-to)	486-491
Number of pages	6
Journal	Journal of Combinatorial Optimization
Volume	19
Issue number	4
DOIs	https://doi.org/10.1007/s10878-008-9179-4
State	Published - 1 May 2010

Keywords

Complex
Decoding
Disjunct matrix
Pooling design

Access to Document

10.1007/s10878-008-9179-4

Fingerprint Dive into the research topics of 'A class of error-correcting pooling designs over complexes'. Together they form a unique fingerprint.

Cite this

@article{61413383daa44391a145a98c84b4ade6,

title = "A class of error-correcting pooling designs over complexes",

abstract = "As a generalization of d e -disjunct matrices and (w,r;d)-cover-free-families, the notion of (s,l) e -disjunct matrices is introduced for error-correcting pooling designs over complexes (or set pooling designs). We show that (w,r,d)-cover-free-families form a class of (s,l) e -disjunct matrices. Moreover, a decoding algorithm for pooling designs based on (s,l) e -disjunct matrices is considered.",

keywords = "Complex, Decoding, Disjunct matrix, Pooling design",

author = "Tayuan Huang and Kaishun Wang and Chih-wen Weng",

year = "2010",

month = may,

day = "1",

doi = "10.1007/s10878-008-9179-4",

language = "English",

volume = "19",

pages = "486--491",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer Netherlands",

number = "4",

}

TY - JOUR

T1 - A class of error-correcting pooling designs over complexes

AU - Huang, Tayuan

AU - Wang, Kaishun

AU - Weng, Chih-wen

PY - 2010/5/1

Y1 - 2010/5/1

N2 - As a generalization of d e -disjunct matrices and (w,r;d)-cover-free-families, the notion of (s,l) e -disjunct matrices is introduced for error-correcting pooling designs over complexes (or set pooling designs). We show that (w,r,d)-cover-free-families form a class of (s,l) e -disjunct matrices. Moreover, a decoding algorithm for pooling designs based on (s,l) e -disjunct matrices is considered.

AB - As a generalization of d e -disjunct matrices and (w,r;d)-cover-free-families, the notion of (s,l) e -disjunct matrices is introduced for error-correcting pooling designs over complexes (or set pooling designs). We show that (w,r,d)-cover-free-families form a class of (s,l) e -disjunct matrices. Moreover, a decoding algorithm for pooling designs based on (s,l) e -disjunct matrices is considered.

KW - Complex

KW - Decoding

KW - Disjunct matrix

KW - Pooling design

UR - http://www.scopus.com/inward/record.url?scp=77950866988&partnerID=8YFLogxK

U2 - 10.1007/s10878-008-9179-4

DO - 10.1007/s10878-008-9179-4

M3 - Article

AN - SCOPUS:77950866988

VL - 19

SP - 486

EP - 491

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 4

ER -

A class of error-correcting pooling designs over complexes

Abstract

Keywords

Access to Document

Other files and links

Cite this