The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
Abstract
Two algebraic methods for systematic construction of structured regular and irregular low-density parity-check (LDPC) codes with girth of at least six and good minimum distances are presented. These two methods are based on geometry decomposition and a masking technique. Numerical results show that the codes constructed by these methods perform close to the Shannon limit and as well as random-like LDPC codes. Furthermore, they have low error floors and their iterative decoding converges very fast. The masking technique greatly simplifies the random-like construction of irregular LDPC codes designed on the basis of the degree distributions of their code graphs
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
Cites
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Cited by
Lan, L., Zeng, L., Tai, Y. Y., Chen, L., Lin, S., & Abdel-Ghaffar, K. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.899516 · Cited by 263
Self-citation
Metadata
- Authors
- Xu, J., Chen, L., Djurdjevic, I., Lin, S., & Abdel-Ghaffar, K.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2007-01
- Volume
- 53
- Issue
- 1
- Pages
- 121-134
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2134523634
- Cited by
- 161
- References
- 1
- FWCI
- 16.75
- 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: Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking. https://app.cochat.ai/papers/10.1109/tit.2006.887082
- The paper
- Xu, J., Chen, L., Djurdjevic, I., Lin, S., & Abdel-Ghaffar, K. (2007). Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2006.887082
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.