pith. sign in

arxiv: 0901.3467 · v1 · submitted 2009-01-22 · 💻 cs.IT · math.IT

Erasure Codes with a Banded Structure for Hybrid Iterative-ML Decoding

classification 💻 cs.IT math.IT
keywords decodingerasurecodesallowschannelhybridmatrixstructure
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.