DocumentCode
2055257
Title
New upper bounds on the expected length of one-to-one codes
Author
Weidmann, Claudio
Author_Institution
IRISA/INRIA, France
fYear
2002
fDate
2002
Firstpage
179
Abstract
We present a new lower bound on differential entropy and use it to tighten Wyner´s lower bound on discrete entropy, H(X)≥E log X. As an application example, we derive tighter upper bounds on the expected length of binary one-to-one codes.
Keywords
binary codes; entropy codes; source coding; Wyner lower bound; binary codes; differential entropy; discrete entropy; expected length; one-to-one codes; upper bounds; Displays; Encoding; Entropy; Equations; Iris; Probability distribution; Random variables; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023451
Filename
1023451
Link To Document