By Topic

Noiseless coding of binary finite-order Markov 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
$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

2 Author(s)

The performance of several simple noiseless coding schemes for binary finite-order Markov sources is considered. Bounds are derived on the maximum difference between the performance achievable by the schemes and the entropy of the sources. The schemes can be modified for the case where the source statistics are unknown.

Published in:

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