By Topic

A generalization of Huffman coding for messages with frequencies given by upper and lower bounds (Corresp.)

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)

A generalization of the Huffman coding procedure is given for cases in which the source letter probabilities are known only to fall in certain ranges.

Published in:

Information Theory, IEEE Transactions on  (Volume:20 ,  Issue: 1 )