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

On the minimum rate for strong universal block coding of a class of ergodic 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
$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)

For a class of ergodic sourcesLambdaon a given finite alphabet satisfying certain conditions, a formula is given for the minimum rate above which strong universal fixed-rate and variable-rate block coding ofLambdawith respect to an arbitrary single-letter fidelity criterion can be done. The result extends several previous strong universal block coding theorems. As an application it is shown that there is a metric on the class of stationary sources weaker thanbar{d}-metric for which compactness ofLambdain the metric implies that strong universal coding can be done at all rates.

Published in:

Information Theory, IEEE Transactions on  (Volume:26 ,  Issue: 6 )

Date of Publication:

Nov 1980

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.