在线阅读 --自然科学版 2009年1期《可纠错pooling设计的一个构作》
可纠错pooling设计的一个构作--[在线阅读]
岳雅璠1, 刘稳2
1. 北华航天工业学院基础部, 河北廊坊 065000;
2. 河北师范大学数学与信息科学学院, 河北石家庄 050016
起止页码: 7--9页
DOI:
摘要
一个非时序性群试(NGT)算法在DNA筛选等领域都有重要应用,而NGT算法的一个数学模型是d-disjunct矩阵.通过Bd**(n,d,k))的Hamming距离构作一个d-disjunct矩阵,其中δ**(n,d,k)是在δc(n,d,k)的基础上加上δc(n,α,k)构成的,1≤α≤m+1且α∈Z;证明了所构作的矩阵是可纠正1个错误、检测2个错误的d-disjunct矩阵.

A Construction of Error-correcting Pooling Design
YUE Ya-fan1, LIU Wen2
1. Department of Basic Courses, North China Institute of Aerospace Engineering, Hebei Langfang 065000, China;
2. College of Mathematics and Information Science, Hebei Normal University, Hebei Shijiazhuang 050016, China
Abstract:
A non-adaptive group testing(NGT)algorithm is useful in many areas.One of the examples is the problem of DNA library screening.While a mat hematical model of NGT algorithm is a d-disjunct matrix.A d-disjunct matrix is const ructed in a simple way.By discussing the Hamming distance of Bd**(n,d,k),where δ**(n,d,k)is the matrix by augmenting the matrix δ(n,d,k)with δc(n,d,k),1≤α≤m+1 andα∈Z,it is implied that our construction gives one error-correcting and two error-detecting NGT algorithm.

收稿日期: 2008-4-13
基金项目: 河北省教育厅自然科学研究项目(Z2007423);河北师范大学青年基金(L2006Q04)

参考文献: