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

The error performance of the ensemble of typical low-definition parity-check (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.

• Publication year

  2008

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2008-03-17

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2009.2018344arXiv 0803.2460
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Upper bound on the error exponent of regular LDPC codes transmitted over the BEC

  2008cited by this paper
• Lower Bounds on the Error Rate of LDPC Code Ensembles

  2007cited by this paper
• Weight Distribution of Low-Density Parity-Check Codes

  2006cited by this paper
• On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles

  2005influential reference
• Lower bounds on the error probability of block codes based on improvements on de Caen's inequality

  2004cited by this paper
• Asymptotic enumeration methods for analyzing LDPC codes

  2004cited by this paper
• Low-Density Parity-Check Codes

  2004cited by this paper
• Stopping set distribution of LDPC code ensembles

  2003cited by this paper
• Finite-length analysis of low-density parity-check codes on the binary erasure channel

  2002cited by this paper
• On ensembles of low-density parity-check codes: Asymptotic distance distributions

  2002cited by this paper
• The capacity of low-density parity-check codes under message-passing decoding

  2001cited by this paper
• Efficient erasure correcting codes

  2001cited by this paper
• The glassy phase of Gallager codes

  2001cited by this paper
• Bounds on the maximum likelihood decoding error probability of low density parity check codes

  2000cited by this paper
• Improved low-density parity-check codes using irregular graphs and belief propagation

  1998cited by this paper
• Good error-correcting codes based on very sparse matrices

  1997cited by this paper
• A lower bound on the probability of a union

  1997cited by this paper
• AN INEQUALITY FOR PROBABILITIES

  1967cited by this paper

• LDPC Over Multihop LoRa Nodes with Peeling Decoder

  2023cites this paper
• New Upper Bounds on the Error Probability under ML Decoding for Spinal Codes and the Joint Transmission-Decoding System Design

  2021cites this paper
• ML performance bounds of turbo and LDPC codes

  2012cites this paper
• Upper bound on the error exponent of regular LDPC codes transmitted over the BEC

  2008cites this paper
• Non-binary LDPC codes and EXIT like functions

  2008cites this paper