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

Local redundancy and progressive bounds on the redundancy of a Huffman code

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

1 Author(s)
Yeung, R.W. ; AT&T Bell Lab., Holmdel, NJ, USA

The concept of local redundancy is introduced, and it is shown that it is a simple but powerful tool for understanding the redundancy of a prefix code. Based on this concept, the redundancy of a prefix code when the structure of the code is partially known is proven. It is shown how this theorem can be used to obtain well-known lower bounds on RHuff, the redundancy of a Huffman code. The theorem is used to obtain a sequence of new lower bounds on RHuff based on the Huffman procedure. A similar sequence of upper bounds on RHuff is obtained. New lower and upper bounds on RHuff when the two smallest probabilities of the source distribution are known are given as corollaries of these results.

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 3 )

Date of Publication:

May 1991

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.