Csiszar's cutoff rates for arbitrary discrete sources

檔案

日期

2001-01-01

類型

期刊名稱

IEEE TRANSACTIONS ON INFORMATION THEORY

卷期與頁次

第 47 卷第 1 期,頁 330–338

ISSN

0018-9448

語言

英文

摘要

Csiszar's forward beta -cutoff rate (given a fixed beta > 0) for a discrete source is defined as the smallest number Ro such that for every R > R-0, there exists a sequence of tired-length codes of rate R with probability of error asymptotically vanishing as e(-n beta (R-R0)). For a discrete memoryless source (DMS), the forward beta -cutoff rate is shown by Csiszar [6] to be equal to the source Renyi entropy. An analogous concept of reverse beta -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 beta -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 beta -cutoff rates, respectively. Consequently, new fixed-length source coding operational characterizations for the Renyi entropy rates are established.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chen, P., & Alajaji, F. (2001). Csiszar's cutoff rates for arbitrary discrete sources. IEEE TRANSACTIONS ON INFORMATION THEORY, 47(1), 330–338. https://doi.org/10.1109/18.904531

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/29924