The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A recursive approach to low complexity codes
Abstract
A method is described for constructing long error-correcting codes from one or more shorter error-correcting codes, referred to as subcodes, and a bipartite graph. A graph is shown which specifies carefully chosen subsets of the digits of the new codes that must be codewords in one of the shorter subcodes. Lower bounds to the rate and the minimum distance of the new code are derived in terms of the parameters of the graph and the subeodes. Both the encoders and decoders proposed are shown to take advantage of the code's explicit decomposition into subcodes to decompose and simplify the associated computational processes. Bounds on the performance of two specific decoding algorithms are established, and the asymptotic growth of the complexity of decoding for two types of codes and decoders is analyzed. The proposed decoders are able to make effective use of probabilistic information supplied by the channel receiver, e.g., reliability information, without greatly increasing the number of computations required. It is shown that choosing a transmission order for the digits that is appropriate for the graph and the subcodes can give the code excellent burst-error correction abilities. The construction principles
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Gallager, R. G., & Peterson, W. W. (1962) · Mathematics of Computation · doi:10.2307/2003832 · Cited by 2,041
Stiffler, J. J. (1971) · Cited by 1,438
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_9 · Cited by 751
On Moore Graphs with Diameters 2 and 3
Hoffman, A. J., & Singleton, R. R. (1960) · IBM Journal of Research and Development · doi:10.1147/rd.45.0497 · Cited by 489
Graph Theory, Coding Theory and Block Designs
Cameron, P. J., & Lint, J. H. (1975) · Cambridge University Press eBooks · doi:10.1017/cbo9781107325425 · Cited by 116
Cited by
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
Design of capacity-approaching irregular low-density parity-check codes
Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910578 · Cited by 3,335
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
Regular and irregular progressive edge-growth tanner graphs
Hu, X.-Y., Eleftheriou, E., & Arnold, D. M. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839541 · Cited by 1,485
Low-density parity-check codes based on finite geometries: a rediscovery and new results
Kou, Y., Lin, S., & Fossorier, M. P. C. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959255 · Cited by 1,302
Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
Fossorier, M. P. C. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.831841 · Cited by 1,219
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
Fossorier, M. P. C., Mihaljevic, M., & Imai, H. (1999) · IEEE Transactions on Communications · doi:10.1109/26.768759 · Cited by 1,041
Efficient encoding of low-density parity-check codes
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910579 · Cited by 1,028
Sipser, M., & Spielman, D. A. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556667 · Cited by 931
An Introduction to factor graphs
Loeliger, H. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1267047 · Cited by 905
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
McEliece, R. J., MacKay, D. J. C., & Cheng, J.-F. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661103 · Cited by 904
Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation
Bocherer, G., Steiner, F., & Schulte, P. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2494016 · Cited by 828
The generalized distributive law
Aji, S. M., & McEliece, R. J. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825794 · Cited by 735
Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$
Declercq, D., & Fossorier, M. (2007) · IEEE Transactions on Communications · doi:10.1109/tcomm.2007.894088 · Cited by 724
Near optimum universal belief propagation based decoding of low-density parity check codes
Chen, J., & Fossorier, M. P. C. (2002) · IEEE Transactions on Communications · doi:10.1109/26.990903 · Cited by 661
Algebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 659
Codes on graphs: normal realizations
Forney, G. D. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910573 · Cited by 642
Using Linear Programming to Decode Binary Linear Codes
Feldman, J., Wainwright, M. J., & Karger, D. R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.842696 · Cited by 572
Efficient encoding of quasi-cyclic low-density parity-check codes
Li, Z., Chen, L., Zeng, L., Lin, S., & Fong, W. H. (2006) · IEEE Transactions on Communications · doi:10.1109/tcomm.2005.861667 · Cited by 463
Design of Low-Density Parity Check Codes for 5G New Radio
Richardson, T., & Kudekar, S. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1700839 · Cited by 433
Channel coding: The road to channel capacity
Costello, D. J., & Forney, G. D. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.895188 · Cited by 408
Selective Avoidance of Cycles in Irregular LDPC Code Construction
Tian, T., Jones, C. R., Villasenor, J. D., & Wesel, R. D. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.833048 · Cited by 395
Liu, Y., Tan, Z., Hu, H., Cimini, L. J., & Li, G. Y. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2320074 · Cited by 394
Iterative decoding of compound codes by probability propagation in graphical models
Kschischang, F. R., & Frey, B. J. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661110 · Cited by 388
The Art of Error Correcting Coding
Morelos‐Zaragoza, R. H. (2002) · Wiley eBooks · doi:10.1002/0470847824 · Cited by 376
Codes and iterative decoding on general graphs
Wiberg, N., Loeliger, H., & Kotter, R. (1995) · European Transactions on Telecommunications · doi:10.1002/ett.4460060507 · Cited by 314
Iterative multiuser joint decoding: unified framework and asymptotic analysis
Boutros, J., & Caire, G. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1013125 · Cited by 314
Machine learning for wireless communications in the Internet of Things: A comprehensive survey
Jagannath, J., Polosky, N., Jagannath, A., Restuccia, F., & Melodia, T. (2019) · Ad Hoc Networks · doi:10.1016/j.adhoc.2019.101913 · Cited by 288
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels
Bennatan, A., & Burshtein, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862080 · Cited by 267
Lan, L., Zeng, L., Tai, Y. Y., Chen, L., Lin, S., & Abdel-Ghaffar, K. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.899516 · Cited by 263
Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
Vasic, B., & Milenkovic, O. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828066 · Cited by 263
Degenerate Quantum LDPC Codes With Good Finite Length Performance
Panteleev, P., & Kalachev, G. (2021) · Quantum · doi:10.22331/q-2021-11-22-585 · Cited by 257
Asymptotically good Quantum and locally testable classical LDPC codes
Panteleev, P., & Kalachev, G. (2022) · Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3519935.3520017 · Cited by 222
“A very important ingredient of the constructions from [13, 14] is expander codes [23], which are the Tanner codes [24] obtained from spectral expander graphs.”
BackgroundDecoding across the quantum low-density parity-check code landscape
Roffe, J., White, D. R., Burton, S., & Campbell, E. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043423 · Cited by 192
Leverrier, A., & Zemor, G. (2022) · 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs54457.2022.00117 · Cited by 140
Post-quantum cryptography : a study of the decoding of QC-MDPC codes
Vasseur, V. (2026) · doi:10.70675/732852a5z1ca0z491dz8a02z51f0a24611b7 · Cited by 3
Quantum error correction and fault tolerance: A comprehensive tutorial
Spencer, D. J., Jain, S. P., Tanggara, A., Sun, Z., Haug, T., Khu, D., & Bharti, K. (2026) · arXiv
Metadata
- Authors
- Tanner, R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1981-09
- Volume
- 27
- Issue
- 5
- Pages
- 533-547
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2133068391
- Cited by
- 3,138
- References
- 11
- FWCI
- 1.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.