Linear programming bounds on the degree distributions of LDPC code ensembles

Authors:
Igal Sason
Affiliations:
Department of Electrical Engineering, Technion, Haifa, Israel
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 6
Cited 0

Convex Optimization

Convex Optimization
On universal properties of capacity-approaching LDPC code ensembles

IEEE Transactions on Information Theory
Modern Coding Theory

Modern Coding Theory
Efficient erasure correcting codes

IEEE Transactions on Information Theory
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications

IEEE Transactions on Information Theory
Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work considers the behavior of the degree distributions of capacity-approaching low-density parity-check (LDPC) code ensembles via linear programming (LP) bounds. These LP bounds are information-theoretic, and they apply to finite-length LDPC codes and to the asymptotic case of an infinite block length. Analytical solutions of these bounds are given in closed form, and the bounds are compared for the BEC with some specific degree distributions of capacity-achieving sequences of LDPC code ensembles. These LP bounds are shown to be informative and are easy to calculate. Due to space limitations, the derivation of the LP bounds is outlined, and the reader is referred to the full paper version [9] for complete proofs and further discussions.