Cascade source coding with erased side information

Ravi Tandon, Soheil Mohajer, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

Abstract

A cascade lossy source coding problem with one encoder and two decoders is considered. All variations of this problem are studied by varying the availability of correlated side information at the encoder/decoder(s). The set of achievable rate-distortion triples is characterized for three instances of this problem when the encoder is interested in transmission of a memoryless equiprobable binary source X subject to Hamming distortion and the side information Y is an erased version of X.

Original languageEnglish (US)
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages2944-2948
Number of pages5
DOIs
StatePublished - Oct 26 2011
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: Jul 31 2011Aug 5 2011

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8104

Other

Other2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
CountryRussian Federation
CitySt. Petersburg
Period7/31/118/5/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Cascade source coding with erased side information'. Together they form a unique fingerprint.

Cite this