摘要
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.
原文 | English |
---|---|
頁(從 - 到) | 486-491 |
頁數 | 6 |
期刊 | Journal of Combinatorial Optimization |
卷 | 19 |
發行號 | 4 |
DOIs | |
出版狀態 | Published - 1 5月 2010 |