Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 173

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Finite-Length Scaling for Iteratively Decoded LDPC Ensembles

Open access
Amraoui, Abdelaziz, Montanari, Andrea, Richardson, Tom, Urbanke, RÜdiger · 2009 · IEEE Transactions on Information Theory

Abstract

We investigate the behavior of iteratively decoded low-density parity-check (LDPC) codes over the binary erasure channel in the so-called ldquowaterfall region.rdquo We show that the performance curves in this region follow a simple scaling law. We conjecture that essentially the same scaling behavior applies in a much more general setting and we provide some empirical evidence to support this conjecture. The scaling law, together with the error floor expressions developed previously, can be used for a fast finite-length optimization.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2008.2009580

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 173

Metadata

Authors
Amraoui, A., Montanari, A., Richardson, T., & Urbanke, R.
Venue
IEEE Transactions on Information Theory
Published
2009-02
Volume
55
Issue
2
Pages
473-498
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2162346886
Cited by
173
References
1
FWCI
23.95
Type
journal article
Language
en
Open access
green

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: Finite-Length Scaling for Iteratively Decoded LDPC Ensembles. https://app.cochat.ai/papers/10.1109/tit.2008.2009580
The paper
Amraoui, A., Montanari, A., Richardson, T., & Urbanke, R. (2009). Finite-Length Scaling for Iteratively Decoded LDPC Ensembles. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2008.2009580

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.