• DocumentCode
    1443142
  • Title

    Csiszar´s cutoff rates for arbitrary discrete sources

  • Author

    Chen, Po-Ning ; Alajaji, Fady

  • Author_Institution
    Dept. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
  • Volume
    47
  • Issue
    1
  • fYear
    2001
  • fDate
    1/1/2001 12:00:00 AM
  • Firstpage
    330
  • Lastpage
    338
  • Abstract
    Csiszar´s (1995) forward β-cutoff rate (given a fixed β>0) for a discrete source is defined as the smallest number R 0 such that for every R>R0, there exists a sequence of fixed-length codes of rate R with probability of error asymptotically vanishing as e-nβ(R-R0). For a discrete memoryless source (DMS), the forward β-cutoff rate is shown by Csiszar to be equal to the source Renyi (1961) entropy. An analogous concept of reverse β-cutoff rate regarding the probability of correct decoding is also characterized by Csiszar in terms of the Renyi entropy. In this work, Csiszar´s results are generalized by investigating the β-cutoff rates for the class of arbitrary discrete sources with memory. It is demonstrated that the limsup and liminf Renyi entropy rates provide the formulas for the forward and reverse β-cutoff rates, respectively. Consequently, new fixed-length source coding operational characterizations for the Renyi entropy rates are established
  • Keywords
    decoding; entropy; error statistics; memoryless systems; source coding; Csiszar´s cutoff rates; Renyi entropy rates; code rate; correct decoding probability; discrete sources; error probability; fixed-length codes; fixed-length source coding; forward β-cutoff rate; memory sources; reverse β-cutoff rate; source Renyi entropy; Constraint theory; Costs; Councils; Decoding; Entropy; Error probability; Genetic expression; Mathematics; Source coding; Transmitters;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.904531
  • Filename
    904531