Journal article
Iterative List Decoding of Some LDPC Codes
Coding and Visual Communication, Department of Photonics Engineering, Technical University of Denmark1
Department of Photonics Engineering, Technical University of Denmark2
Discrete mathematics, Department of Mathematics, Technical University of Denmark3
Department of Mathematics, Technical University of Denmark4
INOPI5
We present an iterative list decoding algorithm for low-density parity-check (LDPC) codes. In particular we apply this decoder to a class of LDPC codes from finite geometries and show that the (73,45,10) projective geometry code can be maximum-likelihood (ML) decoded with low complexity. Moreover, the list decoding approach enables us to give a theoretical analysis of the performance.
We also consider list bit-flipping (BF) decoding of longer LDPC codes.
| Language: | English |
|---|---|
| Publisher: | IEEE |
| Year: | 2007 |
| Pages: | 4276-4284 |
| ISSN: | 15579654 and 00189448 |
| Types: | Journal article |
| DOI: | 10.1109/TIT.2007.907485 |
Analytical models Bit flipping (BF) Block codes Computational modeling Information geometry Iterative algorithms Iterative decoding Iterative methods LDPC codes Maximum likelihood decoding Parity check codes Performance analysis bit-flipping decoding finite geometry code finite-geometry codes iterative decoding iterative list decoding list decoding maximum likelihood estimation parity check codes
