By Topic

Cascade source coding with erased side information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tandon, R. ; Dept. of Electr. Eng., Princeton Univ., Princeton, NJ, USA ; Mohajer, S. ; Poor, H.V.

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.

Published in:

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Date of Conference:

July 31 2011-Aug. 5 2011