Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Robust source coding of weakly compact 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
$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)

A fixed-rate block code is said to be strongly robust for a class of sources \Lambda if its maximum distortion over \Lambda h is no larger than the maximum of the distortion-rate functions of the sources in the class at the rate of the code. It is shown that such codes exist at all positive rates whenever the class is compact with resect to the topology of weak convergence and satisfies certain additional, but not very strong, constraints on the alphabet and distortion measure. Examples of classes that satisfy these conditions are given. In addition, classes are exhibited for which there are no strongly robust codes. These help to demarcate the boundary between classes for which strongly robust codes do and do not exist. More specifically, they show that strongly robust codes exist more widely than strongly universal codes but !ess widely than weakly universal codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:33 ,  Issue: 4 )