Erasure codes with a banded structure for hybrid iterative-ML decoding

Authors:
Alexandre Soro;Mathieu Cunche;Jérôme Lacan;Vincent Roca
Affiliations:
Univ. of Toulouse, ISAE/DMIA, Toulouse cedex 4, France;INRIA Rhone-Alpes, St Ismier cedex, France;Univ. of Toulouse, ISAE/DMIA, Toulouse cedex 4, France;INRIA Rhone-Alpes, St Ismier cedex, France
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 7
Cited 0

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Random Matrices and Codes for the Erasure Channel

Algorithmica
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
Capacity-achieving ensembles for the binary erasure channel with bounded complexity

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents new FEC codes for the erasure channel, LDPC-Band, that have been designed so as to optimize a hybrid iterative-Maximum Likelihood (ML) decoding. Indeed, these codes feature simultaneously a sparse parity check matrix, which allows an efficient use of iterative LDPC decoding, and a generator matrix with a band structure, which allows fast ML decoding on the erasure channel. The combination of these two decoding algorithms leads to erasure codes achieving a very good trade-off between complexity and erasure correction capability.