Bounds on the maximum likelihood decoding error probability of low density parity check codes

G. Miller, D. Burshtein

Research output: Contribution to journalConference articlepeer-review

Abstract

We derive bounds on the error probability of ML decoded LDPC codes; for any binary-input symmetric-output channel. For appropriately chosen ensembles of LDPC codes, reliable communication is possible up to channel capacity. The lower and upper bounds coincide asymptotically, indicating a polynomially decreasing ensemble averaged error probability. For ensembles with suitably chosen parameters, the error probability of almost all codes is exponentially decreasing. Furthermore, the error exponent can be set arbitrarily close to the standard random coding exponent.

Original languageEnglish
Pages (from-to)290
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2000
Event2000 IEEE International Symposium on Information Theory - Serrento, Italy
Duration: 25 Jun 200030 Jun 2000

Fingerprint

Dive into the research topics of 'Bounds on the maximum likelihood decoding error probability of low density parity check codes'. Together they form a unique fingerprint.

Cite this