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

Simple item page
dc.creatorMartinian, Emin
dc.creatorWainwright, Martin J.
dc.date2006-05-21
dc.date.accessioned2026-07-07T08:16:34Z
dc.date.available2026-07-07T08:16:34Z
dc.descriptionWe 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.
dc.descriptionTo appear at International Symposium on Information Theory, Seattle, WA. July 2006
dc.identifierhttps://arxiv.org/abs/cs/0605091
dc.identifierhttp://arxiv.org/abs/cs/0605091
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133820
dc.subjectInformation Theory
dc.titleLow-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds
dc.typetext

Files

Collections

arXiv