Finite-length analysis of low-density parity-check codes on the binary erasure channel

In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expression for the exact average bit and block erasure probability for a given regular ensemble of LDPC codes when decoded i...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2002-06, Vol.48 (6), p.1570-1579
Main Authors: Changyan Di, Proietti, D., Telatar, I.E., Richardson, T.J., Urbanke, R.L.
Format: Article
Language:English
Subjects:
Binary system
Block codes
Blocking
Channel coding
Channels
Decoding
Error correction coding
Information
Information theory
Maximum likelihood decoding
Theory
Upper bounds
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:In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expression for the exact average bit and block erasure probability for a given regular ensemble of LDPC codes when decoded iteratively. We also give expressions for upper bounds on the average bit and block erasure probability for regular LDPC ensembles and the standard random ensemble under maximum-likelihood (ML) decoding. Finally, we present what we consider to be the most important open problems in this area.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2002.1003839