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

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.

DOI: 10.1109/TIT.2002.1003839

Extracted Key Phrases

9 Figures and Tables

020406080'03'05'07'09'11'13'15'17
Citations per Year

694 Citations

Semantic Scholar estimates that this publication has 694 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Di2002FinitelengthAO, title={Finite-length analysis of low-density parity-check codes on the binary erasure channel}, author={Changyan Di and David Proietti and Emre Telatar and Thomas J. Richardson and R{\"{u}diger L. Urbanke}, journal={IEEE Trans. Information Theory}, year={2002}, volume={48}, pages={1570-1579} }