Kenneth K. Tzeng

According to our database1, Kenneth K. Tzeng authored at least 28 papers between 1969 and 1998.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 1995, "For contributions to theory of error-correcting codes".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1998
Lattice labeling algorithms for vector quantization.
IEEE Trans. Circuits Syst. Video Technol., 1998

1996
Generation of matrices for determining minimum distance and decoding of cyclic codes.
IEEE Trans. Inf. Theory, 1996

A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient.
IEEE Trans. Inf. Theory, 1996

The New Minimum Distance Bounds of Goppa Codes and Their Decoding.
Des. Codes Cryptogr., 1996

1995
A code decomposition approach for decoding cyclic and algebraic-geometric codes.
IEEE Trans. Inf. Theory, 1995

Generation of matrices for determining minimum distance and decoding of algebraic-geometric codes.
IEEE Trans. Inf. Theory, 1995

Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring.
IEEE Trans. Inf. Theory, 1995

1994
Simplified understanding and efficient decoding of a class of algebraic-geometric codes.
IEEE Trans. Inf. Theory, 1994

A new procedure for decoding cyclic and BCH codes up to actual minimum distance.
IEEE Trans. Inf. Theory, 1994

1992
On error-and-erasure decoding of cyclic codes.
IEEE Trans. Inf. Theory, 1992

On the generalized Hamming weights of several classes of cyclic codes.
IEEE Trans. Inf. Theory, 1992

1991
Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations.
IEEE Trans. Inf. Theory, 1991

A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes.
IEEE Trans. Inf. Theory, 1991

1989
A generalized Euclidean algorithm for multisequence shift-register synthesis.
IEEE Trans. Inf. Theory, 1989

1985
Further results about the cyclicity of generalized Goppa codes.
Discret. Math., 1985

1984
On Quasi-Perfect Property of Double-Error-Correcting Goppa Codes and Their Complete Decoding
Inf. Control., May, 1984

An algorithm of complete decoding of double-error-correcting Goppa codes.
Proceedings of the Applied Algebra, 1984

1979
Characterization theorems for extending Goppa codes to cyclic codes (Corresp.).
IEEE Trans. Inf. Theory, 1979

1975
On extending Goppa codes to cyclic codes (Corresp.).
IEEE Trans. Inf. Theory, 1975

1974
Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.).
IEEE Trans. Inf. Theory, 1974

1973
On some classes of cyclic codes of composite length (Corresp.).
IEEE Trans. Inf. Theory, 1973

1972
Generalizations of the BCH Bound
Inf. Control., June, 1972

Some results on the minimum distance structure of cyclic codes.
IEEE Trans. Inf. Theory, 1972

A bound for arithmetic codes of composite length (Corresp.).
IEEE Trans. Inf. Theory, 1972

A bound for cyclic codes of composite length (Corresp.).
IEEE Trans. Inf. Theory, 1972

1970
On the minimum distance of certain reversible cyclic codes (Corresp.).
IEEE Trans. Inf. Theory, 1970

Comments on 'A note on the nonbinary BCH code' by Ong, A.
IEEE Trans. Inf. Theory, 1970

1969
On Iterative Decoding of Bch Codes and Decoding Beyond the Bch Bound
PhD thesis, 1969


  Loading...