An introduction to low-density parity-check codes
Theoretical aspects of computer science
An Introduction to Low-Density Parity-Check Codes
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Quasi-systematic doped LT codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Capacity-achieving codes for finite-state channels with maximum-likelihood decoding
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel
IEEE Transactions on Information Theory
On universal properties of capacity-approaching LDPC code ensembles
IEEE Transactions on Information Theory
Quasi-systematic doped LT codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Capacity-achieving codes for channels with memory with maximum-likelihood decoding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Pivoting algorithms for maximum likelihood decoding of LDPC codes over erasure channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On construction of moderate-length LDPC codes over correlated erasure channels
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Transactions on Information Theory
On the design of irregular LDPC code ensembles for BIAWGN channels
IEEE Transactions on Communications
Iterative decoding threshold analysis for LDPC convolutional codes
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
Simple capacity-achieving ensembles of rateless erasure-correcting codes
IEEE Transactions on Communications
Systematic design of low-density parity-check code ensembles for binary erasure channels
IEEE Transactions on Communications
New sequences of capacity achieving LDPC code ensembles over the binary erasure channel
IEEE Transactions on Information Theory
Hi-index | 755.26 |
This paper starts a systematic study of capacity-achieving (c.a.) sequences of low-density parity-check codes for the erasure channel. We introduce a class A of analytic functions and develop a procedure to obtain degree distributions for the codes. We show various properties of this class which help us to construct new distributions from old ones. We then study certain types of capacity-achieving sequences and introduce new measures for their optimality. For instance, it turns out that the right-regular sequence is c.a. in a much stronger sense than, e.g., the Tornado sequence. This also explains why numerical optimization techniques tend to favor graphs with only one degree of check nodes.