A class of error-correcting pooling designs over complexes
| dc.citation.epage | 491 | en_US |
| dc.citation.issue | 4 | en_US |
| dc.citation.spage | 486 | en_US |
| dc.citation.volume | 19 | en_US |
| dc.contributor.author | Huang, Tayuan | en_US |
| dc.contributor.author | Wang, Kaishun | en_US |
| dc.contributor.author | Weng, Chih-Wen | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:14:56Z | |
| dc.date.available | 2014-12-08T15:14:56Z | |
| dc.date.issued | 2010-05-01 | en_US |
| dc.description.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. | en_US |
| dc.identifier.doi | 10.1007/s10878-008-9179-4 | en_US |
| dc.identifier.issn | 1382-6905 | en_US |
| dc.identifier.journal | JOURNAL OF COMBINATORIAL OPTIMIZATION | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1007/s10878-008-9179-4 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/11234 | |
| dc.identifier.wosnumber | WOS:000276504500004 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Pooling design | en_US |
| dc.subject | Disjunct matrix | en_US |
| dc.subject | Decoding | en_US |
| dc.subject | Complex | en_US |
| dc.title | A class of error-correcting pooling designs over complexes | en_US |
| dc.type | Article; Proceedings Paper | en_US |