Cart (Loading....) | Create Account
Close category search window

A general formula of rate-distortion functions for source coding with side information at many decoders

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

2 Author(s)
Matsuta, T. ; Dept. of Commun. & Integrated Syst., Tokyo Inst. of Technol., Tokyo, Japan ; Uyematsu, T.

Heegard and Berger introduced the model of lossy source coding in which side information is available at many decoders. For this model, their showed an upper bound of the rate-distortion function in the case where the source is stationary memoryless. In this paper, we extend their model to the case where the source may be nonstationary and/or nonergodic, and clarify the rate-distortion function for this model. This result is based on the information-spectrum method introduced by Han and Verdú. We also show some special cases of the rate-distortion function, and a single-letterized upper bound of the rate-distortion function in the case where the source is stationary memoryless.

Published in:

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

Date of Conference:

1-6 July 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.