Cart (Loading....) | Create Account
Close category search window
 

Universal redundancy rates do not exist

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

1 Author(s)
Shields, P. ; Dept. of Math., Toledo Univ., OH, USA

The expected redundancy per symbol of an n-block prefix code Cn on a source μ measures how far the code is from being optimal for that source. The existence of sequences of codes with expected redundancy per symbol of O((log n)/n) for `nice' classes of sources, such as Markov sources of a given order, is well known. It is shown that some restriction on the class of processes is necessary in order to obtain such redundancy bounds, for there is no universal redundancy rate for any sequence of prefix codes on the class of all ergodic sources

Published in:

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

Date of Publication:

Mar 1993

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.