Browsing by Author "Huang, Tayuan"

Now showing 1 - 4 of 4

A class of error-correcting pooling designs over complexes
(2010-05-01)
Huang, Tayuan
;
Wang, Kaishun
;
Weng, Chih-Wen
;
應用數學系
;
Department of Applied Mathematics
As a generalization of d (e) -disjunct matrices and (w,r;d)-cover-free-families, the notion of (s,l) (e) -disjunct matrices is introduced for error-correcting pooling designs over complexes (or set pooling designs). We show that (w,r,d)-cover-free-families form a class of (s,l) (e) -disjunct matrices. Moreover, a decoding algorithm for pooling designs based on (s,l) (e) -disjunct matrices is considered.
Error-correcting pooling designs associated with some distance-regular graphs
(2009-07-28)
Bai, Yujuan
;
Huang, Tayuan
;
Wang, Kaishun
;
應用數學系
;
Department of Applied Mathematics
Motivated by the pooling designs over the incidence matrices of matchings with various sizes of the complete graph K(2n) considered by Ngo and Du [Ngo and Du, Discrete Math. 243 (2003) 167-170]. two families of pooling designs over the incidence matrices of t-cliques (resp. strongly t-cliques) with various sizes of the Johnson graph J(n. t) (resp. the Grassmann graph J(q) (n, t)) are considered. Their performances as pooling designs are better than those given by Ngo and Du. Moreover, pooling designs associated with other special distance-regular graphs are also considered. (C) 2009 Elsevier B.V. All rights reserved.
Pooling spaces associated with finite geometry
(2008-08-01)
Huang, Tayuan
;
Wang, Kaishun
;
Weng, Chih-wen
;
應用數學系
;
Department of Applied Mathematics
Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing algorithms with applications to DNA library screening, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 55 (2000) 171-182], the notion of pooling spaces was introduced IT. Huang, C. Weng, Pooling spaces and non-adaptive pooling designs, Discrete Mathematics 282 (2004) 163-169] for a systematic way of constructing pooling designs; note that geometric lattices are among pooling spaces. This paper attempts to draw possible connections from finite geometry and distance regular graphs to pooling spaces: including the projective spaces, the affine spaces, the attenuated spaces, and a few families of geometric lattices associated with the orbits of subspaces under finite classical groups, and associated with d-bounded distance-regular graphs. (C) 2007 Elsevier Ltd. All rights reserved.
Two error-correcting pooling designs from symplectic spaces over a finite field
(2010-11-01)
Li, Zengti
;
Huang, Tayuan
;
Gao, Suogang
;
應用數學系
;
Department of Applied Mathematics
In this paper, we construct two classes of t x n, s(e)-disjunct matrix with subspaces in a symplectic space F(q)((2 nu)) and prove that the ratio efficiency tin of two constructions are smaller than that of D'yachkov et al. (2005) [2]. (C) 2010 Elsevier Inc. All rights reserved.