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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
To appear at International Symposium on Information Theory, Seattle, WA. July 2006

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/133820

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0605091
 http://arxiv.org/abs/cs/0605091

Collections

arXiv