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

Author

Di, Changyan ; Proietti, David ; Telatar, I. Emre ; Richardson, Thomas J. ; Urbanke, Rüdiger L.

Author_Institution

Swiss Fed. Inst. of Technol., Lausanne, Switzerland

Volume

48

Issue

6

fYear

2002

fDate

6/1/2002 12:00:00 AM

Firstpage

1570

Lastpage

1579

Abstract

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

Keywords

block codes; channel coding; error correction codes; iterative decoding; maximum likelihood decoding; LDPC codes; average bit erasure probability; average block erasure probability; belief propagation decoding; binary erasure channel; finite-length analysis; iterative decoding; low-density parity-check codes; maximum-likelihood decoding; standard random ensemble; upper bounds; Belief propagation; Bipartite graph; Code standards; Communication system control; Iterative decoding; Maximum likelihood decoding; Parity check codes; Solids; Terminology; Upper bound;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2002.1003839

Filename

1003839