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 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
Finite-length analysis of irregular expurgated LDPC codes under finite number of iterations
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On a class of doubly-generalized LDPC codes with single parity-check variable nodes
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
Doubly-generalized LDPC codes: stability bound over the BEC
IEEE Transactions on Information Theory
Design of irregular LDPC codes with optimized performance-complexity tradeoff
IEEE Transactions on Communications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On asymptotic ensemble weight enumerators of multi-edge type codes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding
IEEE Transactions on Information Theory
| Hi-index | 755.14 |
We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth rate of the minimum distance of LDPC codes depends only on the degree distribution pair. It turns out that capacity-achieving sequences of standard (unstructured) LDPC codes under iterative decoding over the binary erasure channel (BEC) known to date have sublinearly growing minimum distance in the block length