arXiv:0803.2460

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

Idan Goldenberg, David Burshtein

Published Mar 17, 2008• 0 citations

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.

DOI: 10.48550/arxiv.0803.2460

Related papers

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

Idan Goldenberg, David Burshtein

The error performance of the ensemble of typical LDPC codes transmitted over the binary erasure channel (BEC) is analyzed under iterative decoding. In the past, lower bounds on the error exponent were derived. In this paper a probabilistic upper bound on this error exponent is derived. This bound holds with some confidence level.

International Symposium on Turbo Codes and Iterative Information ProcessingSep 1, 20080 citations

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

Idan Goldenberg, David Burshtein

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.

IEEE Transactions on Information TheoryMay 19, 20094 citations

Upper Bounds on the Error Exponents of LDPC Code Ensembles

David Burshtein, Ohad Barak

We consider the ensemble of regular LDPC codes and use recent concentration results on the distance spectrum to derive upper bounds on the error exponent of a randomly chosen code from the ensemble. These bounds hold with some confidence level that approaches one as the connectivity of the graph increases. We show that the bounds can be used to obtain the true error exponent over some range of channel parameter values, with the above confidence level

IEEE International Symposium on Information Theory (ISIT)Jul 1, 20065 citations

Lower Bounds on the Error Rate of LDPC Code Ensembles

Ohad Barak, David Burshtein

The ensemble of regular low-definition parity-check (LDPC) codes is considered. Using concentration results on the weight distribution, lower bounds on the error rate of a random code in the ensemble are derived. These bounds hold with some confidence level. Combining these results with known lower bounds on the error exponent, confidence intervals on the error exponent, under maximum-likelihood (ML) decoding, are obtained. Over a large range of channel parameter and transmission rate values, when the graph connectivity is sufficiently large, the upper bound of the interval approaches the lower bound, and the probability that the error exponent is within the interval can be arbitrarily close to one. In fact, in this case the true error exponent approaches the maximum between the random coding and the expurgated random coding exponents, with probability that approaches one.

IEEE Transactions on Information TheoryNov 1, 200714 citations

Bounds on Achievable Rates of LDPC Codes Used Over the Binary Erasure Channel

Ohad Barak, David Burshtein, Meir Feder

We derive upper bounds on the maximum achievable rate of low-density parity-check (LDPC) codes used over the binary erasure channel (BEC) under Gallager's decoding algorithm, given their right-degree distribution. We demonstrate the bounds on the ensemble of right-regular LDPC codes and compare them with an explicit left-degree distribution constructed from the given right degree.

IEEE Transactions on Information TheorySep 28, 200420 citations

Asymptotic Enumeration Methods for Analyzing LDPC Codes

David Burshtein, G. Miller

We show how asymptotic estimates of powers of polynomials with nonnegative coefficients can be used in the analysis of low-density parity-check (LDPC) codes. In particular, we show how these estimates can be used to derive the asymptotic distance spectrum of both regular and irregular LDPC code ensembles. We then consider the binary erasure channel (BEC). Using these estimates we derive lower bounds on the error exponent, under iterative decoding, of LDPC codes used over the BEC. Both regular and irregular code structures are considered. These bounds are compared to the corresponding bounds when optimal (maximum-likelihood (ML)) decoding is applied.

IEEE Transactions on Information TheoryJun 1, 2004214 citations