Quasi-systematic doped LT codes
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
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
Linear programming bounds on the degree distributions of LDPC code ensembles
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
Pivoting algorithms for maximum likelihood decoding of LDPC codes over erasure channels
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-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
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.20 |
This paper introduces ensembles of systematic accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity, per information bit, of encoding and decoding. It also introduces symmetry properties which play a central role in the construction of new capacity-achieving ensembles for the BEC. The results here improve on the tradeoff between performance and complexity provided by previous constructions of capacity-achieving code ensembles defined on graphs. The superiority of ARA codes with moderate to large block length is exemplified by computer simulations which compare their performance with those of previously reported capacity-achieving ensembles of low-density parity-check (LDPC) and irregular repeat-accumulate (IRA) codes. ARA codes also have the advantage of being systematic.