Foundations and Trends in Communications and Information Theory
Identical-capacity channel decomposition for design of universal LDPC codes
IEEE Transactions on Communications
On universal properties of capacity-approaching LDPC code ensembles
IEEE Transactions on Information Theory
The generalized area theorem and some of its consequences
IEEE Transactions on Information Theory
| Hi-index | 754.96 |
This paper tightens previous information combining bounds on the performance of iterative decoding of binary low-density parity-check (LDPC) codes over binary-input symmetric-output channels by tracking the probability of erroneous bit in conjunction with mutual information. Evaluation of the new bounds as well as of other known bounds on different LDPC ensembles demonstrates sensitivity of the finite dimensional iterative bounds to lambda2, the fraction of edges connected to degree 2 variable nodes