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

Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder

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)
En-hui Yang ; Dept. Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada ; Da-ke He

A source coding paradigm called interactive encoding and decoding (IED) is considered for a source network where a finite alphabet source X is to be encoded, and another finite alphabet source Y correlated with X is available only to the decoder as a helper. The optimal performance achievable asymptotically (OPAA) by IED is investigated, where the performance is measured as the average number of bits per symbol exchanged by the encoder and decoder until the decoder learns X with high probability. First, it is shown that for any stationary (X, Y), the OPAA by IED is given by the conditional entropy rate H(X|Y) of X given Y. This is in contrast with noninteractive Slepian-Wolf (SW) coding, where the OPAA is shown in general to be strictly greater than H(X|Y) when (X, Y) is not ergodic. Second, for a memoryless source pair (X, Y), it is shown that IED approaches H(X|Y) faster than SW coding does. Finally, it is demonstrated that one can convert any classical universal data compression algorithm with side information to a universal IED algorithm for the class ¿ of all stationary ergodic source pairs. In contrast, universal SW coding algorithms for the class ¿ do not exist.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 4 )

Date of Publication:

April 2010

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.