By Topic

Minimum redundancy zero-error source coding with 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
$33 $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

4 Author(s)
P. Koulgi ; Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA ; E. Tuncel ; S. Regunathan ; K. Rose

We consider the design of instantaneous variable-length zero-error codes where the decoder has access to side information about the source, which is not available to the encoder. We show that finding the optimal code, which minimizes the expected codeword length, is an NP-hard problem. We derive an exponential-time optimal design algorithm. We also provide polynomial-time approximate algorithms, and discuss their average-case and worst-case performance guarantees

Published in:

Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on

Date of Conference: