• DocumentCode
    892536
  • Title

    A large deviation theory proof of the abstract alphabet source coding theorem

  • Author

    Bucklew, J.A.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA
  • Volume
    34
  • Issue
    5
  • fYear
    1988
  • fDate
    9/1/1988 12:00:00 AM
  • Firstpage
    1081
  • Lastpage
    1083
  • Abstract
    A modified proof of T. Berger´s (1971) abstract alphabet source coding with a fidelity criterion theorem is provided, utilizing a variant of a result from large deviation theory. This proof does not use an asymptotic equipartition property of any kind, thus providing what appears to be a more direct approach to this key result
  • Keywords
    codes; encoding; Berger; abstract alphabet source coding theorem; fidelity criterion theorem; large deviation theory; Bit error rate; Convolutional codes; Maximum likelihood decoding; Microcomputers; Random variables; Rate-distortion; Satellites; Source coding; Stability; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.21237
  • Filename
    21237
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=892536