Referenced Items are not available for this document.
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: 2001
- Meeting Date :
- 24 Jun 2001-29 Jun 2001
- Print ISBN:
- 0-7803-7123-2
- INSPEC Accession Number:
- 7092069
- Conference Location :
- Washington, DC
- Digital Object Identifier :
- 10.1109/ISIT.2001.936145
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
