Quasi-systematic doped LT codes
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
Design of irregular LDPC codes with optimized performance-complexity tradeoff
IEEE Transactions on Communications
Bandwidth-efficient modulation codes based on nonbinary irregular repeat-accumulate codes
IEEE Transactions on Information Theory
Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding
IEEE Transactions on Information Theory
LDPC code design considerations for non-uniform channels
IEEE Transactions on Communications
Simple capacity-achieving ensembles of rateless erasure-correcting codes
IEEE Transactions on Communications
New sequences of capacity achieving LDPC code ensembles over the binary erasure channel
IEEE Transactions on Information Theory
Achievable complexity-performance tradeoffs in lossy compression
Problems of Information Transmission
| Hi-index | 755.08 |
We derive upper and lower bounds on the encoding and decoding complexity of two capacity-achieving ensembles of irregular repeat-accumulate (IRA1 and IRA2) codes on the binary erasure channel (BEC). These bounds are expressed in terms of the gap between the channel capacity and the rate of a typical code from this ensemble for which reliable communications is achievable under message-passing iterative (MPI) decoding. The complexity of the ensemble of IRA1 codes grows like the negative logarithm of the gap to capacity. On the other hand, the complexity of the ensemble of IRA2 codes with any choice of the degree distribution grows at least like the inverse square root of the gap to capacity, and at most like the inverse of the gap to capacity.