Identical-capacity channel decomposition for design of universal LDPC codes
IEEE Transactions on Communications
On universal properties of capacity-approaching LDPC code ensembles
IEEE Transactions on Information Theory
Channel coding rate in the finite blocklength regime
IEEE Transactions on Information Theory
| Hi-index | 754.96 |
Based on random codes and typical set decoding, an alternative proof of Root and Varaiya's compound channel coding theorem for linear Gaussian channels is presented. The performance limit of codes with finite block length under a compound channel is studied through error bounds and simulation. Although the theorem promises uniform convergence of the probability of error as the block length approaches infinity, with short block lengths the performance can differ considerably for individual channels. Simulation results show that universal performance can be a practical goal as the block lengths become large.