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

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

Log-domain decoding of LDPC codes over GF(q)

Wymeersch, H., Steendam, H., Moeneclaey, M.·2004·2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)

Abstract

This paper introduces a log-domain decoding scheme for LDPC codes over GF(q). While this scheme is mathematically equivalent to the conventional sum-product decoder, log-domain decoding has advantages in terms of implementation, computational complexity and numerical stability. Further, a suboptimal variant of the log-domain decoding algorithm is proposed, yielding a lower computational complexity. The proposed algorithms and the sum-product algorithm are compared both in terms of simulated BER performance and computational complexity.

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/icc.2004.1312606

Cites

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

Metadata

Authors
Wymeersch, H., Steendam, H., & Moeneclaey, M.
Venue
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)
Publisher
IEEE
Published
2004
Pages
772-776 Vol.2
ISSN
1550-3607 (ISSN-L)
OpenAlex
W2143687662
Cited by
287
References
6
FWCI
2.85
Type
conference paper
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: Log-domain decoding of LDPC codes over GF(q). https://app.cochat.ai/papers/10.1109/icc.2004.1312606
The paper
Wymeersch, H., Steendam, H., & Moeneclaey, M. (2004). Log-domain decoding of LDPC codes over GF(q). 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577). https://doi.org/10.1109/icc.2004.1312606

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.