A Construction of Lossy Source Code Using LDPC Matrices
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An Application of Linear Codes to the Problem of Source Coding with Partial Side Information
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the Suboptimality of Linear Lossy Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Nonlinear sparse-graph codes for lossy compression
IEEE Transactions on Information Theory
Low-density graph codes that are optimal for binning and coding with side information
IEEE Transactions on Information Theory
Hash property and coding theorems for sparse matrices and maximum-likelihood coding
IEEE Transactions on Information Theory
Lossy source compression using low-density generator matrix codes: analysis and algorithms
IEEE Transactions on Information Theory
Limited-rate channel state feedback for multicarrier block fading channels
IEEE Transactions on Information Theory
Achievable complexity-performance tradeoffs in lossy compression
Problems of Information Transmission
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
Problems of Information Transmission
| Hi-index | 0.30 |
We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a set of analysis techniques for deriving upper bounds for the expected distortion of our construction, as well as more general low-density constructions. We show that (with an optimal encoding algorithm) our codes achieve the rate-distortion bound for a binary symmetric source and Hamming distortion. Our methods also provide rigorous upper bounds on the minimum distortion achievable by previously proposed low-density constructions.