IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
A Construction of Lossy Source Code Using LDPC Matrices
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Quasi-systematic doped LT codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Capacity-approaching protograph 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
Fingerprinting with minimum distance decoding
IEEE Transactions on Information Forensics and Security
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
Lower bounds on the graphical complexity of finite-length LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
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
Low-density graph codes that are optimal for binning and coding with side information
IEEE Transactions on Information Theory
Design of irregular LDPC codes with optimized performance-complexity tradeoff
IEEE Transactions on Communications
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Erasure codes with a banded structure for hybrid iterative-ML decoding
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Bandwidth-efficient modulation codes based on nonbinary irregular repeat-accumulate codes
IEEE Transactions on Information Theory
Capacity-approaching irregular turbo codes for the binary erasure channel
IEEE Transactions on Communications
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
Protograph LDPC codes over burst erasure channels
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
New sequences of capacity achieving LDPC code ensembles over the binary erasure channel
IEEE Transactions on Information Theory
| Hi-index | 755.20 |
We present two sequences of ensembles of nonsystematic irregular repeat-accumulate (IRA) codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. This is in contrast to all previous constructions of capacity-achieving sequences of ensembles whose complexity grows at least like the log of the inverse of the gap (in rate) to capacity. The new bounded complexity result is achieved by puncturing bits, and allowing in this way a sufficient number of state nodes in the Tanner graph representing the codes. We derive an information-theoretic lower bound on the decoding complexity of randomly punctured codes on graphs. The bound holds for every memoryless binary-input output-symmetric (MBIOS) channel and is refined for the binary erasure channel.