Elements of information theory
Elements of information theory
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
On the construction of some capacity-approaching coding schemes
On the construction of some capacity-approaching coding schemes
Construction of Universal Codes Using LDPC Matrices and Their Error Exponents
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Modern Coding Theory
The universality of LDPC codes on wireless channels
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
IEEE Transactions on Information Theory
Universal space-time trellis codes
IEEE Transactions on Information Theory
Bounds on information combining
IEEE Transactions on Information Theory
Constrained Information Combining: Theory and Applications for LDPC Coded Systems
IEEE Transactions on Information Theory
A Study on Universal Codes With Finite Block Lengths
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Design of low-density parity-check (LDPC) codes suitable for all channels which exhibit a given capacity C is investigated. Such codes are referred to as universal LDPC codes. First, based on numerous observations, a conjecture is put forth that a code working on N equal-capacity channels, also works on any convex combination of these N channels. As a supporting evidence, we prove that a code satisfying the stability condition on N channels, also satisfies the stability condition on the convex hull of these N channels. Then, a channel decomposition method is suggested which spans any given channel with capacity C in terms of a number of identical-capacity basis channels. We expect codes that work on the basis channels to be suitable for any convex combination of the bases, i.e., all channels with capacity C. Such codes are found over a wide range of rates. An upper bound on the achievable rate of universal LDPC codes is suggested. Through examples, it is shown that our codes achieve rates extremely close to this upper bound. In comparison with existing LDPC codes designed for a given channel, significant performance gain is reported when codes are used over various channels of equal capacity.