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

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

Efficient encoding of quasi-cyclic low-density parity-check codes

Zongwang Li, Lei Chen, Lingqi Zeng, Lin, S., Fong, W.H. · 2006 · IEEE Transactions on Communications

Abstract

Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an important subclass of LDPC codes. These codes have encoding advantage over other types of LDPC codes. This paper addresses the issue of efficient encoding of QC-LDPC codes. Two methods are presented to find the generator matrices of QC-LDPC codes in systematic-circulant (SC) form from their parity-check matrices, given in circulant form. Based on the SC form of the generator matrix of a QC-LDPC code, various types of encoding circuits using simple shift registers are devised. It is shown that the encoding complexity of a QC-LDPC code is linearly proportional to the number of parity bits of the code for serial encoding, and to the length of the code for high-speed parallel encoding.

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/tcomm.2005.861667

Cites

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

Cited by

See all 463

Metadata

Authors
Li, Z., Chen, L., Zeng, L., Lin, S., & Fong, W. H.
Venue
IEEE Transactions on Communications
Published
2006-01
Volume
54
Issue
1
Pages
71-81
ISSN
0090-6778 (ISSN-L)
OpenAlex
W2147776616
Cited by
463
References
20
FWCI
47.86
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: Efficient encoding of quasi-cyclic low-density parity-check codes. https://app.cochat.ai/papers/10.1109/tcomm.2005.861667
The paper
Li, Z., Chen, L., Zeng, L., Lin, S., & Fong, W. H. (2006). Efficient encoding of quasi-cyclic low-density parity-check codes. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2005.861667

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.