Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC
classification
💻 cs.IT
math.IT
keywords
errorboundcodesderivedexponentldpctransmittedupper
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.