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

2008/03/17 by Goldenberg, Idan, Burshtein, David
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.0803.2460

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.

Related

• Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels
• The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number
• Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication
• A Lower Bound on the Error Exponent of Linear Block Codes over the Erasure Channel
• ML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding\n Algorithms