Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC

TL;DR

This paper derives a probabilistic upper bound on the error exponent for regular LDPC codes over the BEC, providing insights into their maximum error performance with a specified confidence level.

Contribution

It introduces a novel probabilistic upper bound on the error exponent for regular LDPC codes over the BEC, complementing existing lower bounds.

Findings

Provides a probabilistic upper bound on error exponent

Bound holds with a specified confidence level

Enhances understanding of LDPC code performance over BEC

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.