Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
IEEE Transactions on Signal Processing
Sharp bounds for optimal decoding of low-density parity-check codes
IEEE Transactions on Information Theory
On universal properties of capacity-approaching LDPC code ensembles
IEEE Transactions on Information Theory
On the fundamental system of cycles in the bipartite graphs of LDPC code ensembles
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
The generalized area theorem and some of its consequences
IEEE Transactions on Information Theory
Scalable diagnosis in IP networks using path-based measurement and inference: A learning framework
Journal of Visual Communication and Image Representation
Low-density graph codes that are optimal for binning and coding with side information
IEEE Transactions on Information Theory
Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel
Quantum Information & Computation
| Hi-index | 755.08 |
We derive upper bounds on the rate of low-density parity-check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager's (1963) bound to a general binary-input symmetric-output channel. We then proceed to derive tighter bounds. We also derive upper bounds on the rate as a function of the minimum distance of the code. We consider both individual codes and ensembles of codes.