A new construction of 3-separable matrices via an improved decoding of Macula's construction
| dc.citation.epage | 704 | en_US |
| dc.citation.issue | 4 | en_US |
| dc.citation.spage | 700 | en_US |
| dc.citation.volume | 5 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | Fu, Hung-Lin | en_US |
| dc.contributor.author | Hwang, F. K. | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:10:45Z | |
| dc.date.available | 2014-12-08T15:10:45Z | |
| dc.date.issued | 2008-11-01 | en_US |
| dc.description.abstract | Macula proposed a novel construction of pooling designs which can effectively identify positive clones and also proposed a decoding method. However, the probability of all unresolved positive clone is hard to analyze. In this paper we propose an improved decoding method and show that ford d = 3 an exact probability analysis is possible. Further, we derive necessary and Sufficient conditions for a positive clone to be unresolved and gave a modified construction which avoids this necessary condition, thus resulting; in a 3-separable matrix. (c) 2008 Elsevier B.V. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/j.disopt.2008.04.002 | en_US |
| dc.identifier.issn | 1572-5286 | en_US |
| dc.identifier.journal | DISCRETE OPTIMIZATION | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/j.disopt.2008.04.002 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/8221 | |
| dc.identifier.wosnumber | WOS:000260086600004 | |
| dc.language.iso | en_US | en_US |
| dc.subject | 3-separable matrices | en_US |
| dc.subject | Macula's construction | en_US |
| dc.title | A new construction of 3-separable matrices via an improved decoding of Macula's construction | en_US |
| dc.type | Article | en_US |