Computer Science – Information Theory
Scientific paper
2008-04-10
Computer Science
Information Theory
6 Pages, 5 Figures. Submitted to the 5th International Symposium on Turbo Codes & Related Topics
Scientific paper
We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given node degree distribution L(x) on the set of generators and for any encoding algorithm. These bounds show that, due to the sparseness of the code, the performance is strictly bounded away from the Shannon rate-distortion function. In this sense, our bounds represent a natural generalization of Gallager's bound on the maximum rate at which low-density parity-check codes can be used for reliable transmission. Our bounds are similar in spirit to the technique recently developed by Dimakis, Wainwright, and Ramchandran, but they apply to individual codes.
Kudekar Shrinivas
Urbanke Ruediger
No associations
LandOfFree
Lower Bounds on the Rate-Distortion Function of Individual 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 Individual 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 Individual LDGM Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-356018