By Topic

On total boundedness for existence of weakly minimax universal codes (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
$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

2 Author(s)

Stationary processes whose restrictions are totally bounded in variation distance are shown to be equivalent to the class of tight measures when the alphabet is countable. For uncountable alphabets, total boundedness implies tightness, but the reverse implication need not hold, as shown by example. Necessary and sufficient conditions for the class of Gaussian processes to be bounded totally are presented. An application of these results to universal coding for composite sources is considered.

Published in:

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