TY - GEN
T1 - Upper bounds on the error exponents of LDPC
AU - Burshtein, David
AU - Barak, Ohad
PY - 2006
Y1 - 2006
N2 - We consider the ensemble of regular LDPC codes and use recent concentration results on the distance spectrum to derive upper bounds on the error exponent of a randomly chosen code from the ensemble. These bounds hold with some confidence level that approaches one as the connectivity of the graph increases. We show that the bounds can be used to obtain the true error exponent over some range of channel parameter values, with the above confidence level.
AB - We consider the ensemble of regular LDPC codes and use recent concentration results on the distance spectrum to derive upper bounds on the error exponent of a randomly chosen code from the ensemble. These bounds hold with some confidence level that approaches one as the connectivity of the graph increases. We show that the bounds can be used to obtain the true error exponent over some range of channel parameter values, with the above confidence level.
UR - http://www.scopus.com/inward/record.url?scp=39049167121&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2006.261699
DO - 10.1109/ISIT.2006.261699
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:39049167121
SN - 1424405041
SN - 9781424405046
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 401
EP - 405
BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
T2 - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Y2 - 9 July 2006 through 14 July 2006
ER -