Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Random coding techniques for nonrandom codes
IEEE Transactions on Information Theory
Universal variable-to-fixed length source codes
IEEE Transactions on Information Theory
Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
IEEE Transactions on Information Theory
A coding theorem for lossy data compression by LDPC codes
IEEE Transactions on Information Theory
The ML decoding performance of LDPC ensembles over Zq
IEEE Transactions on Information Theory
Low-density parity-check matrices for coding of correlated sources
IEEE Transactions on Information Theory
Identical-capacity channel decomposition for design of universal LDPC codes
IEEE Transactions on Communications
Hash property and fixed-rate universal coding theorems
IEEE Transactions on Information Theory
| Hi-index | 0.06 |
A universal coding scheme for information from i.i.d., arbitrarily varying sources, or memoryless correlated sources is constructed using LDPC matrices and shown to have an exponential upper bound of decoding error probability. As a corollary, we construct a universal code for the noisy channel model, which is not necessarily BSC. Simulation results show universality of the code with sum-product decoding, and presence of a gap between the error exponent obtained by simulation and that obtained theoretically.