TY - JOUR
T1 - Bounds on the maximum likelihood decoding error probability of low density parity check codes
AU - Miller, G.
AU - Burshtein, D.
PY - 2000
Y1 - 2000
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0034446706&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0034446706
SN - 2157-8095
SP - 290
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
T2 - 2000 IEEE International Symposium on Information Theory
Y2 - 25 June 2000 through 30 June 2000
ER -