Erasure Codes with a Banded Structure for Hybrid Iterative-ML Decoding
Alexandre Soro, Mathieu Cunche, Jerome Lacan, Vincent Roca

TL;DR
This paper introduces LDPC-Band, a new class of erasure codes with a band-structured generator matrix and sparse parity checks, enabling efficient hybrid iterative-ML decoding for improved erasure correction.
Contribution
The paper proposes LDPC-Band codes that combine sparse parity check matrices with a band-structured generator matrix for optimized hybrid decoding.
Findings
Achieves a good trade-off between decoding complexity and erasure correction.
Enables fast ML decoding due to band-structured generator matrix.
Supports efficient iterative decoding with sparse parity checks.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Telecommunications and Broadcasting Technologies
