By Topic

Constructing codes with bounded codeword lengths (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
$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

1 Author(s)

When the letter probabilities p_1,p_2,\cdots ,p_N for a message source S are unknown, it may be imprudent to construct a Huffman code for S based on the relative frequencies f_1, f_2,\cdots , f_N of the letters in a sample message M . Rather, a more cautious approach is to select an integer b \geq \log _2 N and to construct the code C_b which encodes M most efficiently subject to the restriction that codewords are at most b bits long. This correspondence describes an algorithm for calculating C_b in O((b-\log _2 N)N^2) steps.

Published in:

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