DocumentCode :
2947170
Title :
Rényi´s Entropy and Error Exponent of Source Coding with Countably Infinite Alphabet
Author :
Shimokawa, Hidetoshi
Author_Institution :
Aihara Complexity Modelling Project, Japan Sci. & Technol. Agency
fYear :
2006
fDate :
9-14 July 2006
Firstpage :
1831
Lastpage :
1835
Abstract :
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
Keywords :
entropy; source coding; Renyi entropy; countably infinite alphabet; error exponent; source coding; Decoding; Encoding; Entropy; Probability distribution; Random variables; Source coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
Type :
conf
DOI :
10.1109/ISIT.2006.261751
Filename :
4036284
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2947170
بازگشت