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

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.

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2004-11, Vol.50 (11), p.2837-2844
Main Authors: Burshtein, D., Miller, G.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Channel capacity
Channels
Codes
Coding, codes
Communication channels
Complexity
Computation
Computational complexity
Decoding
Equations
Exact sciences and technology
Information theory
Information, signal and communications theory
Internet
Iterative algorithms
Iterative decoding
Linear systems
Maximum likelihood decoding
Parity check codes
Signal and communications theory
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2004.836694