K.K. Tzeng

930 total citations
32 papers, 596 citations indexed

About

K.K. Tzeng is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, K.K. Tzeng has authored 32 papers receiving a total of 596 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Artificial Intelligence, 19 papers in Electrical and Electronic Engineering and 10 papers in Computer Networks and Communications. Recurrent topics in K.K. Tzeng's work include Coding theory and cryptography (30 papers), graph theory and CDMA systems (13 papers) and Error Correcting Code Techniques (9 papers). K.K. Tzeng is often cited by papers focused on Coding theory and cryptography (30 papers), graph theory and CDMA systems (13 papers) and Error Correcting Code Techniques (9 papers). K.K. Tzeng collaborates with scholars based in United States, China and South Korea. K.K. Tzeng's co-authors include G.L. Feng, C. Hartmann, Gui-Liang Feng, Victor K. Wei, T.R.N. Rao, R. T. Chien, Ke Shen, Chunxiang Wang, Chun Wang and Weiping Li and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Circuits and Systems for Video Technology and Discrete Mathematics.

In The Last Decade

K.K. Tzeng

30 papers receiving 559 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
K.K. Tzeng United States	12	561	401	205	185	52	32	596
G.L. Feng United States	9	484 0.9×	316 0.8×	154 0.8×	128 0.7×	15 0.3×	16	524
Nicolas Sendrier France	13	618 1.1×	300 0.7×	152 0.7×	224 1.2×	23 0.4×	29	659
S.M. Dodunekov Bulgaria	11	432 0.8×	324 0.8×	103 0.5×	210 1.1×	18 0.3×	41	473
Iwan Duursma United States	13	368 0.7×	178 0.4×	99 0.5×	171 0.9×	17 0.3×	44	450
Olav Geil Denmark	11	280 0.5×	170 0.4×	84 0.4×	102 0.6×	22 0.4×	34	341
Michael E. O’Sullivan United States	11	277 0.5×	238 0.6×	108 0.5×	148 0.8×	14 0.3×	35	401
Yanfeng Qi China	12	650 1.2×	414 1.0×	142 0.7×	237 1.3×	19 0.4×	44	665
Maosheng Xiong Hong Kong	14	467 0.8×	298 0.7×	141 0.7×	83 0.4×	22 0.4×	56	551
Victor Zinoviev Russia	14	901 1.6×	750 1.9×	160 0.8×	158 0.9×	38 0.7×	79	946
A. J. Han Vinck Germany	12	226 0.4×	213 0.5×	110 0.5×	160 0.9×	64 1.2×	33	336

Countries citing papers authored by K.K. Tzeng

Since Specialization

Citations

This map shows the geographic impact of K.K. Tzeng's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by K.K. Tzeng with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites K.K. Tzeng more than expected).

Fields of papers citing papers by K.K. Tzeng

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by K.K. Tzeng. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by K.K. Tzeng. The network helps show where K.K. Tzeng may publish in the future.

Co-authorship network of co-authors of K.K. Tzeng

This figure shows the co-authorship network connecting the top 25 collaborators of K.K. Tzeng. A scholar is included among the top collaborators of K.K. Tzeng based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with K.K. Tzeng. K.K. Tzeng is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Tzeng, K.K., et al.. (2005). On Error-and-erasure Decoding Of Cyclic Codes Up To The Roos Bound. 92–92.

Tzeng, K.K., et al.. (2002). Lattice labeling algorithms for vector quantization. 56–56. 3 indexed citations

Li, Weiping, et al.. (1998). Lattice labeling algorithms for vector quantization. IEEE Transactions on Circuits and Systems for Video Technology. 8(2). 206–220. 6 indexed citations

Shen, Ke, et al.. (1996). Generation of matrices for determining minimum distance and decoding of cyclic codes. IEEE Transactions on Information Theory. 42(2). 653–657. 10 indexed citations

Tzeng, K.K., et al.. (1996). A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient. IEEE Transactions on Information Theory. 42(6). 1987–1991. 10 indexed citations

Tzeng, K.K., et al.. (1995). Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring. IEEE Transactions on Information Theory. 41(6). 1694–1702. 7 indexed citations

Tzeng, K.K., et al.. (1995). Generation of matrices for determining minimum distance and decoding of algebraic-geometric codes. IEEE Transactions on Information Theory. 41(6). 1703–1708. 6 indexed citations

Tzeng, K.K., et al.. (1995). A code decomposition approach for decoding cyclic and algebraic-geometric codes. IEEE Transactions on Information Theory. 41(6). 1969–1987. 10 indexed citations

Feng, Gui-Liang & K.K. Tzeng. (1994). A new procedure for decoding cyclic and BCH codes up to actual minimum distance. IEEE Transactions on Information Theory. 40(5). 1364–1374. 40 indexed citations

10.

Tzeng, K.K., et al.. (1992). On error-and-erasure decoding of cyclic codes. IEEE Transactions on Information Theory. 38(2). 489–496. 9 indexed citations

11.

Feng, G.L. & K.K. Tzeng. (1989). A generalized Euclidean algorithm for multisequence shift-register synthesis. IEEE Transactions on Information Theory. 35(3). 584–594. 38 indexed citations

12.

Tzeng, K.K., et al.. (1985). Further results about the cyclicity of generalized Goppa codes. Discrete Mathematics. 56(2-3). 281–290. 3 indexed citations

13.

Feng, G.L. & K.K. Tzeng. (1984). On quasi-perfect property of double-error-correcting Goppa codes and their complete decoding. Information and Control. 61(2). 132–146. 2 indexed citations

14.

Tzeng, K.K., et al.. (1979). Characterization theorems for extending Goppa codes to cyclic codes (Corresp.). IEEE Transactions on Information Theory. 25(2). 246–250. 9 indexed citations

15.

Hartmann, C. & K.K. Tzeng. (1974). Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.). IEEE Transactions on Information Theory. 20(2). 292–295. 11 indexed citations

16.

Hartmann, C. & K.K. Tzeng. (1973). On some classes of cyclic codes of composite length (Corresp.). IEEE Transactions on Information Theory. 19(6). 820–823. 2 indexed citations

17.

Hartmann, C. & K.K. Tzeng. (1972). Generalizations of the BCH bound. Information and Control. 20(5). 489–498. 92 indexed citations

18.

Hartmann, C., K.K. Tzeng, & R. T. Chien. (1972). Some results on the minimum distance structure of cyclic codes. IEEE Transactions on Information Theory. 18(3). 402–409. 18 indexed citations

19.

Hartmann, C. & K.K. Tzeng. (1972). A bound for cyclic codes of composite length (Corresp.). IEEE Transactions on Information Theory. 18(2). 307–307. 1 indexed citations

20.

Hartmann, C. & K.K. Tzeng. (1971). A Bound for Cyclic Codes of Composite Length. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact