Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC
Information Theory
2008-03-18 v1 math.IT
Abstract
The error performance of the ensemble of typical LDPC codes transmitted over the binary erasure channel (BEC) is analyzed. In the past, lower bounds on the error exponents were derived. In this paper a probabilistic upper bound on this error exponent is derived. This bound holds with some confidence level.
Keywords
Cite
@article{arxiv.0803.2460,
title = {Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC},
author = {Idan Goldenberg and David Burshtein},
journal= {arXiv preprint arXiv:0803.2460},
year = {2008}
}