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

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

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

Abstract

This letter explains the effect of graph connectivity on error-floor performance of low-density parity-check (LDPC) codes under message-passing decoding. A new metric, called extrinsic message degree (EMD), measures cycle connectivity in bipartite graphs of LDPC codes. Using an easily computed estimate of EMD, we propose a Viterbi-like algorithm that selectively avoids small cycle clusters that are isolated from the rest of the graph. This algorithm is different from conventional girth conditioning by emphasizing the connectivity as well as the length of cycles. The algorithm yields codes with error floors that are orders of magnitude below those of random codes with very small degradation in capacity-approaching capability.

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.

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

Integrity signals

Registry

Crossref · 10.1109/tcomm.2004.833048

Cites

8 of 8 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.

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.

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 8 references

Cited by

See all 395

Metadata

Authors
Tian, T., Jones, C. R., Villasenor, J. D., & Wesel, R. D.
Venue
IEEE Transactions on Communications
Published
2004-08
Volume
52
Issue
8
Pages
1242-1247
ISSN
0090-6778 (ISSN-L)
OpenAlex
W2136204051
Cited by
395
References
8
FWCI
23.96
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: Selective Avoidance of Cycles in Irregular LDPC Code Construction. https://app.cochat.ai/papers/10.1109/tcomm.2004.833048
The paper
Tian, T., Jones, C. R., Villasenor, J. D., & Wesel, R. D. (2004). Selective Avoidance of Cycles in Irregular LDPC Code Construction. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2004.833048

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.