A lower bound on the probability of a union
Discrete Mathematics
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Improved low-density parity-check codes using irregular graphs
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
IEEE Transactions on Information Theory
On ensembles of low-density parity-check codes: asymptotic distance distributions
IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
Lower bounds on the error probability of block codes based on improvements on de Caen's inequality
IEEE Transactions on Information Theory
Asymptotic enumeration methods for analyzing LDPC codes
IEEE Transactions on Information Theory
Stopping set distribution of LDPC code ensembles
IEEE Transactions on Information Theory
On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles
IEEE Transactions on Information Theory
Weight Distribution of Low-Density Parity-Check Codes
IEEE Transactions on Information Theory
Lower Bounds on the Error Rate of LDPC Code Ensembles
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
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.