Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
