Subscribe

Los Angeles, CA

March 31, 2009 to April 2, 2009

ISBN: 978-0-7695-3507-4

pp: 324-326

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.742

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 mathematical model of NGT algorithm is a $d-$disjunct matrix. In this paper, we construct a $d-$disjunct matrix in a simple way. By discussing the Hamming distance of $B_d(\delta^{**}(n,d,k))$, where $\delta^{**}(n,d,k)$ is the matrix by augmenting the matrix $\delta(n,d,k)$ with $\delta^c(n,\alpha,k)$, $1\leq\alpha\leq m+1$ and $\alpha\in \mathbb{Z}$,we imply that our construction gives one error-correcting and two error-detecting NGT algorithm.

CITATION

Wen Liu,
Yafan Yue,
"A Construction of an Error-Correcting Pooling Design",

*CSIE*, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 324-326, doi:10.1109/CSIE.2009.742