DocumentCode
1779533
Title
Informational divergence and entropy rate on rooted trees with probabilities
Author
Bocherer, Georg ; Amjad, Rana Ali
Author_Institution
Inst. for Commun. Eng., Tech. Univ. Munchen, Munich, Germany
fYear
2014
fDate
June 29 2014-July 4 2014
Firstpage
176
Lastpage
180
Abstract
Rooted trees with probabilities are used to analyze properties of variable length codes. A bound is derived on the difference between the entropy rates of such codes and memoryless sources. The bound is in terms of normalized informational divergence and is used to derive converses for exact random number generation, resolution coding, and distribution matching.
Keywords
entropy codes; probability; random number generation; trees (mathematics); variable length codes; distribution matching; entropy rate; exact random number generation; memoryless sources; normalized informational divergence; probability; resolution coding; rooted trees; variable length codes; Encoding; Entropy; Joints; MIMICs; Random number generation; Random variables;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location
Honolulu, HI
Type
conf
DOI
10.1109/ISIT.2014.6874818
Filename
6874818
Link To Document