Computer Science – Information Theory
Scientific paper
2008-08-15
Computer Science
Information Theory
22 Pages, Submitted for publication
Scientific paper
A 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.
Dimakis Alexandros G.
Ramchandran Kannan
Wainwright Martin J.
No associations
LandOfFree
Lower Bounds on the Rate-Distortion Function of LDGM Codes 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 Lower Bounds on the Rate-Distortion Function of LDGM Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bounds on the Rate-Distortion Function of LDGM Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-650440