分别利用单纯复形、完全图中的匹配、t-填充和有限域上的辛空间、酉空间讨论了d-析取矩阵看作是d-m析取时的容错和纠错性,证明了当d减小时,它们的容错和纠错能力可显著增强.
[1] Tayuan Huang, Chih-wen Weng. Pooling spaces and non-adaptive pooling designs [J]. Discrete mathematics 2004, 1/3(1/3).
[2] Anthony J. Macula. Error-correcting nonadaptive group testing with de-disjunct matrices [J]. Discrete Applied Mathematics 1997, 2/3(2/3).
[3] HUANG T Y, WENG C W. A note on decoding of superimposed codes [J]. Journal of Combinatorial Optimization 2003, 7.
[4] Wu WL, Huang YC, Huang X, Li YS. On error-tolerant DNA screening [J]. Discrete Applied Mathematics 2006, 12(12).
[5] PARK H, WU W L, LIU Z. DNA screening, pooling designs and simplicial complex [J]. Journal of Combinatorial Optimization 2003, 7.
[6] Hung Q. Ngo, Ding-Zhu Du. New constructions of non-adaptive and error-tolerance pooling designs [J]. Discrete mathematics 2002, 1/3(1/3).
[7] Fu HL, Hwang FK. A novel use of t-packings to construct d-disjunct matrices [J]. Discrete Applied Mathematics 2006, 12(12).
[8] WAN Z X. Geometry of classical groups over finite fields [M]. Lund:Studentlitteratur/Bromtey:Chartwell-Bratt 1993.