Tight lower bounds for optimum code length (Corresp.)
- 1 March 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 28 (2) , 348-349
- https://doi.org/10.1109/tit.1982.1056467
Abstract
A new lower bound for the mean code length of all one-to-one codes for a random variable withnoutcomes 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
This publication has 3 references indexed in Scilit:
- Universal modeling and codingIEEE Transactions on Information Theory, 1981
- Optimal noiseless coding of random variables (Corresp.)IEEE Transactions on Information Theory, 1980
- Some equivalences between Shannon entropy and Kolmogorov complexityIEEE Transactions on Information Theory, 1978