Near optimum error correcting coding and decoding: turbo-codes
Abstract
This paper presents a new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving. Decoding calls on iterative processing in which each component decoder takes advantage of the work of the other at the previous step, with the aid of the original concept of extrinsic information. For sufficiently large interleaving sizes, the correcting performance of turbo-codes, investigated by simulation, appears to be close to the theoretical limit predicted by Shannon.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Such an auto-associative network constitutes a turbo code.
“thus constituting a turbo code (Berrou and Glavieux, 1996)”
From An Integrated World Modeling Theory (IWMT) of Consciousness (2020) · cites this paper as Berrou and Glavieux, 1996
Cited by
Sorted by citations
Optimized transmission of JPEG2000 streams over wireless channels
Thomos, N., Boulgouris, N. V., & Strintzis, M. G. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.860338 · Cited by 258 · see citing works
Safron, A. (2020) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2020.00030 · Cited by 133 · see citing works
“…from various modalities may form an auto-associative network supporting loopy belief propagation— or message passing—thus constituting a turbo code (Berrou and Glavieux, 1996), and hence approaching the Shannon limit with respect to optimality in communicating information over noisy channels (…”
BackgroundEntanglement-Assisted Quantum Turbo Codes
Wilde, M. M., Hsieh, M.-H., & Babar, Z. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2292052 · Cited by 102 · see citing works
- Authors
- Berrou, C., & Glavieux, A.
- Affiliations
- Télécom Bretagne (FR)
- Venue
- IEEE Transactions on Communications
- Published
- 1996
- Volume
- 44
- Issue
- 10
- Pages
- 1261-1271
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2102251435
- Cited by
- 2,761
- References
- 0
- Citations by year
- 2026: 14 · 2025: 27 · 2024: 22 · 2023: 32 · 2022: 36 · 2021: 25 · 2020: 35 · 2019: 54 · 2018: 81 · 2017: 76 · 2016: 78 · 2015: 97 · 2014: 103 · 2013: 105 · 2012: 120
- FWCI
- 46.05
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Communications (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Communication Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Keywords
- turbo codes, convolutional codes, iterative decoding, extrinsic information, error-correcting codes, Shannon limit, channel capacity
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
