Graph theory and its applications
Graph theory and its applications
Convex Optimization
Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel
IEEE Transactions on Information Theory
The generalized area theorem and some of its consequences
IEEE Transactions on Information Theory
Modern Coding Theory
Which codes have cycle-free Tanner graphs?
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Efficient erasure correcting codes
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Upper bounds on the rate of LDPC codes
IEEE Transactions on Information Theory
Capacity-achieving sequences for the erasure channel
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The rate of regular LDPC codes
IEEE Transactions on Information Theory
Sphere-packing bounds revisited for moderate block lengths
IEEE Transactions on Information Theory
Capacity-achieving ensembles for the binary erasure channel with bounded complexity
IEEE Transactions on Information Theory
Tight bounds for LDPC and LDGM codes under MAP decoding
IEEE Transactions on Information Theory
Raptor codes on binary memoryless symmetric channels
IEEE Transactions on Information Theory
Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels
IEEE Transactions on Information Theory
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
IEEE Transactions on Information Theory
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
IEEE Transactions on Information Theory
Constrained Information Combining: Theory and Applications for LDPC Coded Systems
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A Study on Universal Codes With Finite Block Lengths
IEEE Transactions on Information Theory
Extremal Problems of Information Combining
IEEE Transactions on Information Theory
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
IEEE Transactions on Information Theory
Capacity Achieving LDPC Codes Through Puncturing
IEEE Transactions on Information Theory
The renaissance of Gallager's low-density parity-check codes
IEEE Communications Magazine
Sharp bounds for optimal decoding of low-density parity-check codes
IEEE Transactions on Information Theory
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel
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
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
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Iterative decoding threshold analysis for LDPC convolutional codes
IEEE Transactions on Information Theory
Wireless Personal Communications: An International Journal
Hi-index | 755.03 |
This paper is focused on the derivation of some universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles whose transmission takes place over memoryless binary-input output-symmetric (MBIOS) channels. Properties of the degree distributions, graphical complexity, and the number of fundamental cycles in the bipartite graphs are considered via the derivation of information-theoretic bounds. These bounds are expressed in terms of the target block/bit error probability and the gap (in rate) to capacity. Most of the bounds are general for any decoding algorithm, and some others are proved under belief propagation (BP) decoding. Proving these bounds under a certain decoding algorithm, validates them automatically also under any suboptimal decoding algorithm. A proper modification of these bounds makes them universal for the set of all MBIOS channels which exhibit a given capacity. Bounds on the degree distributions and graphical complexity apply to finite-length LDPC codes and to the asymptotic case of an infinite block length. The bounds are compared with capacity-approaching LDPC code ensembles under BP decoding, and they are shown to be informative and are easy to calculate. Finally, some interesting open problems are considered.