Computer Science – Information Theory
Scientific paper
2006-01-30
Computer Science
Information Theory
To be published in Proceedings of the Data Compression Conference; Snowbird, Utah, March 2006; 10 pages total
Scientific paper
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.
Martinian Emin
Wainwright Martin J.
No associations
LandOfFree
Low density codes achieve the rate-distortion bound does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Low density codes achieve the rate-distortion bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low density codes achieve the rate-distortion bound will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-14123