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 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.

• Type: Journal
• Year: 2002
• Where: TIT
• Authors: Changyan Di, David Proietti, Ì. Emre Telatar, Thomas J. Richardson, Rüdiger L. Urbanke
• Keywords: Average Bit, Binary Erasure Channel, Erasure Probability, TIT 2002