Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Performance of Standard Irregular LDPC Codes under Maximum Likelihood Decoding
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the Stopping Distance and Stopping Redundancy of Product Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Combined Matrix Ensemble of Low-Density Parity-Check Codes for Correcting a Solid Burst Erasure
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Capacity-approaching protograph codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
On asymptotic ensemble weight enumerators of LDPC-like codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Upper bound on error exponent of regular LDPC codes transmitted over the BEC
IEEE Transactions on Information Theory
Secure communication with a Byzantine relay
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Weight distributions of multi-edge type LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Performance bounds for nonbinary linear block codes over memoryless symmetric channels
IEEE Transactions on Information Theory
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On the undetected error probability of binary matrix ensembles
IEEE Transactions on Information Theory
Performance bounds for erasure, list and decision feedback schemes with linear block codes
IEEE Transactions on Information Theory
Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding
IEEE Transactions on Information Theory
Protograph LDPC codes over burst erasure channels
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Hi-index | 755.14 |
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.