论文信息 - Rényi's Entropy and Error Exponent of Source Coding with Countably Infinite Alphabet

Rényi's Entropy and Error Exponent of Source Coding with Countably Infinite Alphabet

This paper discuss the relation between Renyi's entropy rate and error exponent of source coding. This is a generalization of Csiszar's beta-cutoff rate. We extend the result to arbitrary discrete sources even when the alphabet is countably infinite

Hidetoshi Shimokawa

[1] Te Sun Han. The reliability functions of the general source with fixed-length coding , 2000, IEEE Trans. Inf. Theory.

[2] Hiroki Koga,et al. Information-Spectrum Methods in Information Theory , 2002 .

[3] Hidetoshi Shimokawa. Renyi's Entropy Rate and Source Coding Bounds for General Sources , 2005 .

[4] Fady Alajaji,et al. Csiszár's cutoff rates for arbitrary discrete sources , 2001, IEEE Trans. Inf. Theory.

[5] Imre Csiszár. Generalized cutoff rates and Renyi's information measures , 1995, IEEE Trans. Inf. Theory.

[6] Mark Burgin,et al. Foundations of Information Theory , 2008, ArXiv.