default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenneth K. Tzeng
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j26]Chun Wang, Hugh Q. Cao, Weiping Li, Kenneth K. Tzeng:
Lattice labeling algorithms for vector quantization. IEEE Trans. Circuits Syst. Video Technol. 8(2): 206-220 (1998)- 1996
- [j25]Chang-Seop Park, Gui Liang Feng, Kenneth K. Tzeng:
The New Minimum Distance Bounds of Goppa Codes and Their Decoding. Des. Codes Cryptogr. 9(2): 157-176 (1996) - [j24]Katherine K. Shen, Chun Wang, Kenneth K. Tzeng, Ba-Zhong Shen:
Generation of matrices for determining minimum distance and decoding of cyclic codes. IEEE Trans. Inf. Theory 42(2): 653-657 (1996) - [j23]Ba-Zhong Shen, Kenneth K. Tzeng, Chun Wang:
A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient. IEEE Trans. Inf. Theory 42(6): 1987-1991 (1996) - 1995
- [j22]Ba-Zhong Shen, Kenneth K. Tzeng:
Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring. IEEE Trans. Inf. Theory 41(6): 1694-1702 (1995) - [j21]Ba-Zhong Shen, Kenneth K. Tzeng:
Generation of matrices for determining minimum distance and decoding of algebraic-geometric codes. IEEE Trans. Inf. Theory 41(6): 1703-1708 (1995) - [j20]Ba-Zhong Shen, Kenneth K. Tzeng:
A code decomposition approach for decoding cyclic and algebraic-geometric codes. IEEE Trans. Inf. Theory 41(6): 1969-1987 (1995) - 1994
- [j19]Gui Liang Feng, Victor K.-W. Wei, Thammavarapu R. N. Rao, Kenneth K. Tzeng:
Simplified understanding and efficient decoding of a class of algebraic-geometric codes. IEEE Trans. Inf. Theory 40(4): 981-1002 (1994) - [j18]Gui Liang Feng, Kenneth K. Tzeng:
A new procedure for decoding cyclic and BCH codes up to actual minimum distance. IEEE Trans. Inf. Theory 40(5): 1364-1374 (1994) - 1992
- [j17]Homayoun Shahri, Kenneth K. Tzeng:
On error-and-erasure decoding of cyclic codes. IEEE Trans. Inf. Theory 38(2): 489-496 (1992) - [j16]Gui Liang Feng, Kenneth K. Tzeng, Victor K.-W. Wei:
On the generalized Hamming weights of several classes of cyclic codes. IEEE Trans. Inf. Theory 38(3): 1125-1130 (1992) - 1991
- [j15]Gui Liang Feng, Kenneth K. Tzeng:
A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes. IEEE Trans. Inf. Theory 37(5): 1274-1287 (1991) - [j14]Gui Liang Feng, Kenneth K. Tzeng:
Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations. IEEE Trans. Inf. Theory 37(6): 1716-1723 (1991)
1980 – 1989
- 1989
- [j13]Gui Liang Feng, Kenneth K. Tzeng:
A generalized Euclidean algorithm for multisequence shift-register synthesis. IEEE Trans. Inf. Theory 35(3): 584-594 (1989) - 1985
- [j12]Kenneth K. Tzeng, Gui Liang Feng:
Further results about the cyclicity of generalized Goppa codes. Discret. Math. 56(2-3): 281-290 (1985) - 1984
- [j11]Gui Liang Feng, Kenneth K. Tzeng:
On Quasi-Perfect Property of Double-Error-Correcting Goppa Codes and Their Complete Decoding. Inf. Control. 61(2): 132-146 (1984) - [c1]Gui Liang Feng, Kenneth K. Tzeng:
An algorithm of complete decoding of double-error-correcting Goppa codes. AAECC 1984: 154-160
1970 – 1979
- 1979
- [j10]Kenneth K. Tzeng, C. Y. Yu:
Characterization theorems for extending Goppa codes to cyclic codes (Corresp.). IEEE Trans. Inf. Theory 25(2): 246-250 (1979) - 1975
- [j9]Kenneth K. Tzeng, Kuno P. Zimmermann:
On extending Goppa codes to cyclic codes (Corresp.). IEEE Trans. Inf. Theory 21(6): 712-716 (1975) - 1974
- [j8]Carlos R. P. Hartmann, Kenneth K. Tzeng:
Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.). IEEE Trans. Inf. Theory 20(2): 292-295 (1974) - 1973
- [j7]Carlos R. P. Hartmann, Kenneth K. Tzeng:
On some classes of cyclic codes of composite length (Corresp.). IEEE Trans. Inf. Theory 19(6): 820-823 (1973) - 1972
- [j6]Carlos R. P. Hartmann, Kenneth K. Tzeng:
Generalizations of the BCH Bound. Inf. Control. 20(5): 489-498 (1972) - [j5]Carlos R. P. Hartmann, Kenneth K. Tzeng:
A bound for cyclic codes of composite length (Corresp.). IEEE Trans. Inf. Theory 18(2): 307 (1972) - [j4]Carlos R. P. Hartmann, Kenneth K. Tzeng:
A bound for arithmetic codes of composite length (Corresp.). IEEE Trans. Inf. Theory 18(2): 308 (1972) - [j3]Carlos R. P. Hartmann, Kenneth K. Tzeng, Robert T. Chien:
Some results on the minimum distance structure of cyclic codes. IEEE Trans. Inf. Theory 18(3): 402-409 (1972) - 1970
- [j2]Kenneth K. Tzeng, Carlos R. P. Hartmann:
On the minimum distance of certain reversible cyclic codes (Corresp.). IEEE Trans. Inf. Theory 16(5): 644-646 (1970) - [j1]Kenneth K. Tzeng:
Comments on 'A note on the nonbinary BCH code' by Ong, A. IEEE Trans. Inf. Theory 16(5): 648-649 (1970)
1960 – 1969
- 1969
- [b1]Kenneth K. Tzeng:
On Iterative Decoding of Bch Codes and Decoding Beyond the Bch Bound. University of Illinois Urbana-Champaign, USA, 1969
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
