DocumentCode :
934411
Title :
Tight lower bounds for optimum code length (Corresp.)
Author :
Rissanen, Jorma
Volume :
28
Issue :
2
fYear :
1982
fDate :
3/1/1982 12:00:00 AM
Firstpage :
348
Lastpage :
349
Abstract :
A new lower bound for the mean code length of all one-to-one codes for a random variable with 
outcomes is derived. The bound, which is tight, improves an earlier one due to Leung-Yan-Cheong and Cover. Another bound for one-to-one codes for binary information sources is derived.
outcomes is derived. The bound, which is tight, improves an earlier one due to Leung-Yan-Cheong and Cover. Another bound for one-to-one codes for binary information sources is derived.Keywords :
Source coding; Books; Dictionaries; Erbium; Probability; Random variables; Telegraphy; Tellurium;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1982.1056467
Filename :
1056467
Link To Document :
