Elements of information theory
Elements of information theory
Source Coding Algorithms Using the Randomness of a Past Sequence
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Low Density Codes Achieve theRate-Distortion Bound
DCC '06 Proceedings of the Data Compression Conference
Random coding techniques for nonrandom codes
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
IEEE Transactions on Information Theory
Nested linear/lattice codes for structured multiterminal binning
IEEE Transactions on Information Theory
Distributed source coding using syndromes (DISCUS): design and construction
IEEE Transactions on Information Theory
A coding theorem for lossy data compression by LDPC codes
IEEE Transactions on Information Theory
Low-density parity-check matrices for coding of correlated sources
IEEE Transactions on Information Theory
On code design for the Slepian-Wolf problem and lossless multiterminal networks
IEEE Transactions on Information Theory
| Hi-index | 0.01 |
This paper clarifies the adequacy of the linear channel coding approach for the source coding with partial side information at the decoder. A sufficient condition for an ensemble of linear codes which achieves the Wyner's bound is given. Our result reveals that, by combining a good lossy code, an LDPC code ensemble gives a good code for source coding with partial side information at the decoder.