By Topic

Universal source coding of finite alphabet sources via composition classes

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)

The universal source coding theorem for stationary sources states that, by using a preselected code with sufficiently large block length, any stationary source can be encoded arbitrarily close to the optimum performance theoretically attainable for the source. The code construction typically used to prove this theorem offers no performance guarantees for nonstationary sources. A code construction (based on composition classes) is described which is shown to be universal for stationary sources. In addition, this code construction guarantees that the distortion for any block in the sequence will not exceed a maximum value determined by its composition.

Published in:

IEEE Transactions on Information Theory  (Volume:25 ,  Issue: 5 )