The DOI matches its Crossref record.
Iterative reliability-based decoding of low-density parity check codes
Abstract
In this paper, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between belief propagation decoding which remains suboptimum, and maximum likelihood decoding which is too complex to be implemented for the codes considered. Trade-offs between decoding complexity and error performance are also investigated. In particular, a stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is proposed for this combined decoding approach. Simulation results for several Gallager (1963, 1968) LDPC codes and different set cyclic codes of hundreds of information bits are given and elaborated.
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
Cited by
Deep Learning Methods for Improved Decoding of Linear Codes
Nachmani, E., Marciano, E., Lugosch, L., Gross, W. J., Burshtein, D., & Be'ery, Y. (2018) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2017.2788405 · Cited by 545
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
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
Decoding 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
RNN Decoding of Linear Block Codes
Nachmani, E., Marciano, E., Burshtein, D., & Be'ery, Y. (2017) · arXiv · doi:10.48550/arxiv.1702.07560 · Cited by 93
Metadata
- Authors
- Fossorier, M. P. C.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2001-05
- Volume
- 19
- Issue
- 5
- Pages
- 908-917
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2119319086
- Cited by
- 166
- References
- 0
- FWCI
- 8.60
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Iterative reliability-based decoding of low-density parity check codes. https://app.cochat.ai/papers/10.1109/49.924874
- The paper
- Fossorier, M. P. C. (2001). Iterative reliability-based decoding of low-density parity check codes. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/49.924874
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.