Finite-length analysis of low-density parity-check codes on thebinary erasure channel
Changyan Di
Proietti, D.
Telatar, I.E.
Richardson, T.J.
Urbanke, R.L.
Swiss Fed. Inst. of Technol., Lausanne;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Jun 2002
Volume: 48,
Issue: 6
On page(s): 1570-1579
ISSN: 0018-9448
References Cited: 16
CODEN: IETTAW
INSPEC Accession Number: 7297389
Digital Object Identifier: 10.1109/TIT.2002.1003839
Current Version Published: 2002-08-07
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
