Publication View

Low density codes achieve the rate-distortion bound (2006)

Abstract
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.. Comment: To be published in Proceedings of the Data Compression Conference; Snowbird, Utah, March 2006; 10 pages total

Publication details
Download http://arxiv.org/abs/cs/0601123
Repository arXiv (United States)
Keywords Computer Science - Information Theory
Type text