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

@article{Martinian2006LowdensityCC,
  title={Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds},
  author={Emin Martinian and Martin J. Wainwright},
  journal={2006 IEEE International Symposium on Information Theory},
  year={2006},
  pages={484-488}
}
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… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS