• DocumentCode
    943165
  • Title

    Robust source coding of weakly compact classes

  • Author

    Neuhoff, David L. ; Garcia-munoz, Roberto

  • Volume
    33
  • Issue
    4
  • fYear
    1987
  • fDate
    7/1/1987 12:00:00 AM
  • Firstpage
    522
  • Lastpage
    530
  • 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.
  • Keywords
    Block coding; Robustness; Source coding; Block codes; Convergence; Distortion measurement; Helium; Information theory; Random processes; Rate distortion theory; Robustness; Source coding; Topology;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1987.1057331
  • Filename
    1057331