Computer Science – Information Theory
Scientific paper
2006-02-13
Computer Science
Information Theory
5 pages; to appear in Workshop on Information Theory and its Applications, February 2006, San Diego
Scientific paper
Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on the effective rate-distortion function of LDGM codes for the binary symmetric source, showing that they quickly approach the rate-distortion function as the degree increases. We also compare and contrast the standard LDGM construction with a compound LDPC/LDGM construction introduced in our previous work, which provably saturates the rate-distortion bound with finite degrees. Moreover, this compound construction can be used to generate nested codes that are simultaneously good as source and channel codes, and are hence well-suited to source/channel coding with side information. The sparse and high-girth graphical structure of our constructions render them well-suited to message-passing encoding.
Martinian Emin
Wainwright Martin J.
No associations
LandOfFree
Analysis of LDGM and compound codes for lossy compression and binning 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 Analysis of LDGM and compound codes for lossy compression and binning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of LDGM and compound codes for lossy compression and binning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-167066