By Topic

Compact encoding of stationary Markov sources

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)

We treat the problem of encoding the outputs from a controllable rate source whose output statistics can be accurately described as a stationary finite-state Markov process. The class of encoding schemes considered is restricted to those in which each output from the source is encoded as a separate, uniquely decodable codeword. We present a uniquely decodable scheme in this class which minimizes the ensemble average length of the transmitted message corresponding to any number of outputs from the source, i.e., a compact encoding scheme. The code used will vary with time as a function of the entire past history of the source. The future encoding of the outputs from a sample source with any given past history will be compact also. Although the efficiency of the encoding scheme can be improved by enlarging the class of schemes considered, e.g., by applying the technique presented herein to higher order extensions of the source, this topic is not pursued.

Published in:

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