Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds

Details Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds

2006-05-21

arxiv.org/abs/cs/0605091v1

Computer Science

Information Theory

To appear at International Symposium on Information Theory, Seattle, WA. July 2006

Scientific paper

We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder side information (the Gelfand-Pinsker problem). Our approach relies on a combination of low-density parity check (LDPC) codes and low-density generator matrix (LDGM) codes, and produces sparse constructions that are simultaneously good as both source and channel codes. In particular, we prove that under maximum likelihood encoding/decoding, there exist low-density codes (i.e., with finite degrees) from our constructions that can saturate both the Wyner-Ziv and Gelfand-Pinsker bounds.

Affiliated with

Also associated with

No associations

Rating

Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds 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 Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-630858