By Topic

On the average codeword length of optimal binary codes for extended sources (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

2 Author(s)

Although optimal binary source coding using symbol blocks of increasing length must eventually yield a code having an average codeword length arbitrarily close to the source entropy, it is known that the sequence of average codeword lengths need not be nonincreasing. The sequence is, however, bounded above by the average codeword length of the source, and certain subsequences must be nondecreasing. Sufficient conditions are obtained describing sources for which a decrease in average codeword length is achieved when coding pairs of symbols. A sufficient condition specifying sources for which no such decrease is possible is also obtained.

Published in:

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