期刊文献+

利用酉空间中的子空间构造d^z-析取矩阵

Constructing d^z-disjunct matrices with subspaces of unitary space
下载PDF
导出
摘要 容错的Pooling设计数学模型是d^z-析取矩阵,在实践中具有广泛的应用。在有限域上的酉空间中,利用2种不同类型的子空间之间的包含关系构建了一类d^z-析取矩阵。这类d^z-析取矩阵的行和列分别由这2种不同类型的子空间来标识,而且该类矩阵是0-1矩阵,如果标识该行的子空间包含在标识该列的子空间当中,其行列交叉处的元素为1,否则为0。首先,将问题进行了转化,从而缩小了讨论范围;接着,利用酉空间中的计数定理进行计算和比较,进一步缩小了讨论范围;之后,利用容斥原理以及酉空间中计数定理确定了d^z-析取矩阵中参数d的取值范围;最后,利用此结果确定了反映d^z-析取矩阵纠错能力的参数z,即证明了z的存在性及紧性。 The mathematical model of an error-tolerant pooling design is a d^z-disjunct matrix,which is widely used in practice.A class of d^z-disjunct matrices are constructed by using the inclusion relation between two different types of subspaces in unitary space over a finite field.The row and column of this class of d^z-disjunct matrices are indexed respectively by the two different types of subspaces,and the matrices of this class are 0-1 matrices,their element at the intersection of the row and column is 1 if the subspace indexing the row is included in the subspace indexing the column,otherwise it is 0.Firstly,the problem is transformed to narrow the scope of the discussion,and then the counting theorem in unitary space is used for calculation and comparison to further narrow the scope of the discussion.After that,the value range of the parameter d in the d^z-disjunct matrices is determined by using the inclusion-exclusion principle and the counting theorem in unitary space.Finally,the parameter z which reflects the error correction capability of the d^z-disjunctmatrices is determined by using this result,that is,the existence and compactness of z are proved.
作者 张丽华 何佳霓 ZHANG Lihua;HE Jiani(College of Mathematics and Systems Science, Shenyang Normal University, Shenyang 110034, China)
出处 《沈阳师范大学学报(自然科学版)》 CAS 2020年第6期543-547,共5页 Journal of Shenyang Normal University:Natural Science Edition
基金 辽宁省教育厅科学研究经费项目(LQN201902) 高等学校大学数学教学研究与发展中心2019年教改项目(CMC20190502)。
关键词 分组测试 d^z-析取矩阵 酉空间 POOLING设计 group testing dz-disjunct matrix unitary space pooling design
  • 相关文献

参考文献5

二级参考文献24

  • 1Balding D J, Bruno W J, Knill E, Torney D C. A Comparative of Non-adaptive Pooling Design. Genetic Mapping and DNA Sequencing (Minneapolis, MN, 1994). New York: Springer, 1996:133 154.
  • 2Du D Z, Hwang F K. Combinatorial Group Testing and Its Applications (2nd ed). Singapore: World Scientific, 2000.
  • 3Du D Z, Hwang F K. Pooling Designs and Nonadaptive Group Testing: Important Tools for DNA Se- quencing. Singapore: World Scientific, 2006.
  • 4D'yachkov A G, Hwang F K, Macula A J, et al. A construction of pooling designs with some happy surprises. Journal of Computational Biology, 2005, 12:1129-1136.
  • 5Macula A J, Rykov V V, Yekhanin S. Trivial two-stage group testing for complexes using almost disjunct matrices. Discrete Applied Mathematics, 2004, 137:97-107.
  • 6Balding D J, Torney D C. Optimal pooling design with error detection. Journal of Combinatorial Theory (Series A), 1996, 74:131- 140.
  • 7Macula A J. A simple construction of d-disjunct matrices with certain constant weights. Discrete Mathe- matics, 1996, 162:311-312.
  • 8Macula A J. Error-correcting nonadaptive group testing with de-disjunct matrices. Discrete Applied Mathematics, 1997, 80:217-222.
  • 9Knill E, Bruno W J, Torney D C. Non-adaptive group testing in the presence of error. Discrete Applied Mathematics. 1998: 88:261-290.
  • 10Ngo H Q, Du D Z. New constructions of non-adaptive and error-tolerance pooling designs. Discrete Mathematics, 2002, 243:161-170.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部