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

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

Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices

Fossorier, M.P.C. · 2004 · IEEE Transactions on Information Theory

Abstract

In this correspondence, the construction of low-density parity-check (LDPC) codes from circulant permutation matrices is investigated. It is shown that such codes cannot have a Tanner graph representation with girth larger than 12, and a relatively mild necessary and sufficient condition for the code to have a girth of 6, 8,10, or 12 is derived. These results suggest that families of LDPC codes with such girth values are relatively easy to obtain and, consequently, additional parameters such as the minimum distance or the number of redundant check sums should be considered. To this end, a necessary condition for the codes investigated to reach their maximum possible minimum Hamming distance is proposed.

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.2004.831841

Cites

11 of 11 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 11 references

Cited by

See all 1,219

Metadata

Authors
Fossorier, M. P. C.
Venue
IEEE Transactions on Information Theory
Published
2004-08
Volume
50
Issue
8
Pages
1788-1793
ISSN
0018-9448 (ISSN-L)
OpenAlex
W1973712217
Cited by
1,219
References
11
FWCI
37.31
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: Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices. https://app.cochat.ai/papers/10.1109/tit.2004.831841
The paper
Fossorier, M. P. C. (2004). Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2004.831841

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.