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

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
$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)

When the letter probabilitiesp_1,p_2,cdots,p_Nfor a message sourceSare unknown, it may be imprudent to construct a Huffman code forSbased on the relative frequenciesf_1, f_2,cdots, f_Nof the letters in a sample messageM. Rather, a more cautious approach is to select an integerb geq log_2 Nand to construct the codeC_bwhich encodesMmost efficiently subject to the restriction that codewords are at mostbbits long. This correspondence describes an algorithm for calculatingC_binO((b-log_2 N)N^2)steps.

Published in:

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

Date of Publication:

Mar 1974

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.