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

By Henk Wymeersch, Heidi Steendam, Marc Moeneclaey. IEEE International Conference on Communications, 2004

312 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/e9e033a272c2647f4ad47c84b73dbf2e6ca29985

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. David Declercq
2. Marc P. C. Fossorier

In Electrical and Electronic Engineering

1. David Declercq
2. Marc P. C. Fossorier

Citations in the corpus

• Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ (2007, methodology): “As a result, the algorithm proposed in [12] has complexity per iteration at the variable nodes and at the check nodes, assuming the recursive updating proposed in [6].”