Low density codes achieve the rate-distortion bound
| dc.creator | Martinian, Emin | |
| dc.creator | Wainwright, Martin J. | |
| dc.date | 2006-01-30 | |
| dc.date.accessioned | 2026-07-07T08:16:20Z | |
| dc.date.available | 2026-07-07T08:16:20Z | |
| dc.description | 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. | |
| dc.description | To be published in Proceedings of the Data Compression Conference; Snowbird, Utah, March 2006; 10 pages total | |
| dc.identifier | https://arxiv.org/abs/cs/0601123 | |
| dc.identifier | http://arxiv.org/abs/cs/0601123 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133744 | |
| dc.subject | Information Theory | |
| dc.title | Low density codes achieve the rate-distortion bound | |
| dc.type | text |