By Topic

Comparison of two optimum rates for noiseless encoding of a nonstationary information source

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)
J. C. Kieffer ; Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA

A nonstationary finite-alphabet information source μ is noiselessly encoded, first by adaptive block to variable-length codes and then by finite-state codes of this kind. It is shown that if μ belongs to a certain class of sources that includes those with finite-order Markov memory, then a stationary input-restricted channel exists such that in the first case the optimum encoding rate is equal to the largest conditional entropy for channel input given channel output, whereas in the second case it is the largest channel output entropy. A sufficient condition for the two rates to be equal is also given

Published in:

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