Lower Bounds on the Rate-Distortion Function of LDGM Codes

Simple item page
dc.creatorDimakis, A. G.
dc.creatorWainwright, M. J.
dc.creatorRamchandran, K.
dc.date2008-08-15
dc.date.accessioned2026-07-07T09:56:51Z
dc.date.available2026-07-07T09:56:51Z
dc.descriptionA recent line of work has focused on the use of low-density generator matrix (LDGM) codes for lossy source coding. In this paper, wedevelop a generic technique for deriving lower bounds on the rate-distortion functions of binary linear codes, with particular interest on the effect of bounded degrees. The underlying ideas can be viewing as the source coding analog of the classical result of Gallager, providing bounds for channel coding over the binary symmetric channel using bounded degree LDPC codes. We illustrate this method for different random ensembles of LDGM codes, including the check-regular ensemble and bit-check-regular ensembles, by deriving explicit lower bounds on their rate-distortion performance as a function of the degrees.
dc.description22 Pages, Submitted for publication
dc.identifierhttps://arxiv.org/abs/0808.2073
dc.identifierhttp://arxiv.org/abs/0808.2073
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/167129
dc.subjectInformation Theory
dc.titleLower Bounds on the Rate-Distortion Function of LDGM Codes
dc.typetext

Files

Collections

arXiv