Topic · Error Correcting Code Techniques
Most cited papers in Error Correcting Code Techniques
What are the most cited papers in Error Correcting Code Techniques?
The most cited paper in Error Correcting Code Techniques is "Least squares quantization in PCM" (Sheelagh Lloyd, 1982), with 16,039 citations. Next come "Low-density parity-check codes" (10,733) and "Identification of common molecular subsequences" (10,175).
Showing 50 of 98 papers. Every paper with more than 669 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Least squares quantization in PCM Sheelagh Lloyd · IEEE Transactions on Information Theory | Mar 1982 | 16,039 |
| 2 | Low-density parity-check codes Robert G. Gallager · IEEE Transactions on Information Theory | 1962 | 10,733 |
| 3 | Identification of common molecular subsequences Temple F. Smith, Michael S. Waterman · Journal of Molecular Biology | Mar 1981 | 10,175 |
| 4 | Network information flow Rudolf Ahlswede, Ning Cai, Shuo Li et al. · IEEE Transactions on Information Theory | Jul 2000 | 7,890 |
| 5 | Space-time codes for high data rate wireless communication: performance criterion and code construction Vahid Tarokh, Nambi Seshadri, A.R. Calderbank · IEEE Transactions on Information Theory | Mar 1998 | 7,113 |
| 6 | Error bounds for convolutional codes and an asymptotically optimum decoding algorithm Andrew J. Viterbi · IEEE Transactions on Information Theory | Apr 1967 | 6,861 |
| 7 | Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 Claude Berrou, Alain Glavieux, Punya Thitimajshima | 30 Dec 2002 | 6,739 |
| 8 | Factor graphs and the sum-product algorithm Frank R. Kschischang, Brendan J. Frey, Hans‐Andrea Loeliger · IEEE Transactions on Information Theory | 2001 | 6,555 |
| 9 | Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) L.R. Bahl, John Cocke, F. Jelinek et al. · IEEE Transactions on Information Theory | Mar 1974 | 5,204 |
| 10 | Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels Erdal Arıkan · IEEE Transactions on Information Theory | 16 Jun 2009 | 4,564 |
| 11 | Channel Coding Rate in the Finite Blocklength Regime Yury Polyanskiy, H. Vincent Poor, Sergio Verdú · IEEE Transactions on Information Theory | 26 Apr 2010 | 4,051 |
| 12 | Good error-correcting codes based on very sparse matrices David Mackay · IEEE Transactions on Information Theory | Mar 1999 | 3,740 |
| 13 | Design of capacity-approaching irregular low-density parity-check codes Tom Richardson, Mohammad Amin Shokrollahi, Rudiger L. Urbanke · IEEE Transactions on Information Theory | 2001 | 3,412 |
| 14 | A recursive approach to low complexity codes R. Michael Tanner · IEEE Transactions on Information Theory | Sep 1981 | 3,178 |
| 15 | The capacity of low-density parity-check codes under message-passing decoding Tom Richardson, Rudiger L. Urbanke · IEEE Transactions on Information Theory | 2001 | 3,120 |
| 16 | Arithmetic coding for data compression Ian H. Witten, Radford M. Neal, John G. Cleary · Communications of the ACM | Jun 1987 | 2,896 |
| 17 | LT codes Michael G. Luby | 26 Jun 2003 | 2,786 |
| 18 | Near optimum error correcting coding and decoding: turbo-codes Claude Berrou, Alain Glavieux · IEEE Transactions on Communications | 1996 | 2,771 |
| 19 | Near Shannon limit performance of low density paritycheck codes David Mackay, Radford M. Neal · Electronics Letters | 13 Mar 1997 | 2,698 |
| 20 | Iterative decoding of binary block and convolutional codes Joachim Hagenauer, Elke Offer, L. Papke · IEEE Transactions on Information Theory | Mar 1996 | 2,320 |
| 21 | Bit-interleaved coded modulation G. Caire, Giorgio Taricco, E. Biglieri · IEEE Transactions on Information Theory | May 1998 | 2,223 |
| 22 | A Technique for High-Performance Data Compression Welch · Computer | Jun 1984 | 2,199 |
| 23 | Raptor codes Amin Shokrollahi · IEEE Transactions on Information Theory | Jun 2006 | 2,149 |
| 24 | Achieving near-capacity on a multiple-antenna channel Bertrand M. Hochwald, Stephan ten Brink · IEEE Transactions on Communications | Mar 2003 | 2,046 |
| 25 | Wireless Information-Theoretic Security Matthieu R. Bloch, João Barros, Miguel R. D. Rodrigues et al. · IEEE Transactions on Information Theory | 29 May 2008 | 1,897 |
| 26 | List Decoding of Polar Codes Ido Tal, Alexander Vardy · IEEE Transactions on Information Theory | 5 Mar 2015 | 1,867 |
| 27 | The information bottleneck method Tishby, Naftali, Fernando C. N. Pereira, William Bialek · arXiv (Cornell University) | 24 Apr 2000 | 1,861 |
| 28 | Rate-compatible punctured convolutional codes (RCPC codes) and their applications Joachim Hagenauer · IEEE Transactions on Communications | Apr 1988 | 1,838 |
| 29 | Polyphase codes with good periodic correlation properties (Corresp.) Delin Chu · IEEE Transactions on Information Theory | Jul 1972 | 1,739 |
| 30 | A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain Patrick Robertson, Emmanuelle Villebrun, Peter Adam Hoeher | 19 Nov 2002 | 1,696 |
| 31 | A new achievable rate region for the interference channel Te Sun Han, Katsushi Kobayashi · IEEE Transactions on Information Theory | 1981 | 1,695 |
| 32 | Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms Jonathan S. Yedidia, William T. Freeman, Yaakov Weiss · IEEE Transactions on Information Theory | 28 Jun 2005 | 1,673 |
| 33 | On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit Sae-Young Chung, G. David Forney, Tom Richardson et al. · IEEE Communications Letters | 2001 | 1,557 |
| 34 | On the inherent intractability of certain coding problems (Corresp.) Elwyn R. Berlekamp, Robert J. McEliece, Henk van Tilborg · IEEE Transactions on Information Theory | May 1978 | 1,527 |
| 35 | Regular and irregular progressive edge-growth tanner graphs Xiaoyu Hu, Evangelos S. Eleftheriou, Donald M. Arnold · IEEE Transactions on Information Theory | 2005 | 1,511 |
| 36 | A Viterbi algorithm with soft-decision outputs and its applications Joachim Hagenauer, Peter Adam Hoeher | 13 Jan 2003 | 1,427 |
| 37 | Estimation of a Model with Multiple Indicators and Multiple Causes of a Single Latent Variable Karl G. Jöreskog, Arthur S. Goldberger · Journal of the American Statistical Association | Sep 1975 | 1,409 |
| 38 | Low-density parity-check codes based on finite geometries: a rediscovery and new results Y. Kou, Shu Lin, M.P.C. Fossorier · IEEE Transactions on Information Theory | 2001 | 1,329 |
| 39 | On maximum-likelihood detection and the search for the closest lattice point Mohamed Oussama Damen, H. El Gamal, G. Caire · IEEE Transactions on Information Theory | Oct 2003 | 1,319 |
| 40 | Iterative correction of intersymbol interference: Turbo‐equalization Catherine Douillard, Michel Jézéquel, Claude Berrou et al. · European Transactions on Telecommunications | Sep 1995 | 1,317 |
| 41 | Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding Sergio Benedetto, D. Divsalar, G. Montorsi et al. · IEEE Transactions on Information Theory | May 1998 | 1,270 |
| 42 | Raptor Codes Amin Shokrollahi | Jul 2007 | 1,263 |
| 43 | Distributed Video Coding Bernd Girod, A. Aaron, Shantanu D. Rane et al. · Proceedings of the IEEE | 20 Dec 2004 | 1,257 |
| 44 | Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices M.P.C. Fossorier · IEEE Transactions on Information Theory | 27 Jul 2004 | 1,236 |
| 45 | Low-density parity check codes over GF(q) Matthew C. Davey, David Mackay · IEEE Communications Letters | Jun 1998 | 1,224 |
| 46 | Turbo equalization: principles and new results M. Tüchler, R. Koetter, Andrew C. Singer · IEEE Transactions on Communications | May 2002 | 1,221 |
| 47 | Efficient erasure correcting codes Michael G. Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi et al. · IEEE Transactions on Information Theory | 2001 | 1,195 |
| 48 | Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation Sae-Young Chung, Tom Richardson, Rudiger L. Urbanke · IEEE Transactions on Information Theory | 2001 | 1,157 |
| 49 | Generalized approximate message passing for estimation with random linear mixing Sundeep Rangan | Jul 2011 | 1,147 |
| 50 | Reduced complexity iterative decoding of low-density parity check codes based on belief propagation M.P.C. Fossorier, Miodrag J. Mihaljević, Hirotaka Imai · IEEE Transactions on Communications | May 1999 | 1,048 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.