Efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

Authors:
D. Burshtein;G. Miller
Affiliations:
Sch. of Electr. Eng., Tel Aviv Univ., Israel;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Performance versus overhead for fountain codes over Fq

IEEE Communications Letters
Pivoting algorithms for maximum likelihood decoding of LDPC codes over erasure channels

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On construction of moderate-length LDPC codes over correlated erasure channels

ICC'09 Proceedings of the 2009 IEEE international conference on Communications

Quantified Score

Hi-index	754.84

Visualization

Abstract

We propose an efficient maximum-likelihood (ML) decoding algorithm for decoding low-density parity-check (LDPC) codes over the binary-erasure channel (BEC). We also analyze the computational complexity of the proposed algorithm.