Browsing by Author "Huang, T"

Now showing 1 - 3 of 3

A note on decoding of superimposed codes
(2003-12-01)
Huang, T
;
Weng, CW
;
應用數學系
;
Department of Applied Mathematics
A superimposed code with general distance D can be used to construct a non-adaptive pooling design. It can then be used to identify a fewunknown positives from a large set of items by associating naturally an outcome vector u. A simple method for decoding the outcome vector u is given whenever there are at most [D-1/2] errors occuring in the outcome vector u. Moreover, another simple method of detecting whether there is any error occuring in the outcome vector u is also given whenever there are at most D - 1 errors in u. Our method is a generalization of the classical result of Kautz and Singleton (Nonadaptive binary superimposed codes, IEEE Trans. Inform. Theory, vol. 10, pp. 363 - 377, 1964).
Some classes of four-weight spin models
(2001-04-01)
Guo, H
;
Huang, T
;
應用數學系
;
Department of Applied Mathematics
We classify four-weight spin models (X; W-1, W-2, W-3, W-4) with sizes at most four. We also study the class of four-weight spin models with exactly two distinct values in W-4, reduce their existence to that of certain symmetric designs. (C) 2001 Elsevier Science B.V. All rights reserved.
Spectral characterization of some generalized odd graphs
(1999)
Huang, T
;
Liu, CR
;
應用數學系
;
Department of Applied Mathematics
Suppose G is a connected, k-regular graph such that Spec(G) = Spec(Gamma) where Gamma is a distance-regular graph of diameter d with parameters a(1) = a(2) = ... = a(d-1) = 0 and a(d) > 0; i.e., a generalized odd graph, we show that G must be distance-regular with the same intersection array as that of Gamma in terms of the notion of Hoffman Polynomials. Furthermore, G is isomorphic to Gamma if Gamma is one of the odd polygon C2d+1 the Odd graph Od+1, the folded (2d + 1)-cube, the coset graph of binary Golay code (d = 3), the Hoffman-Singleton graph (d = 2), the Gewirtz graph (d = 2), the Higman-Sims graph (d = 2), or the second subconstituent of the Higman-Sims graph (d = 2).