Upper bounds on exponentiated expected length of optimal one-to-one codes
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition
ACM Transactions on Algorithms (TALG)
Assembling approximately optimal binary search trees efficiently using arithmetics
Information Processing Letters
Minimum expected length of fixed-to-variable lossless compression of memoryless sources
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
| Hi-index | 754.84 |
We provide new bounds on the expected length L of a binary one-to-one code for a discrete random variable X with entropy H. We prove that L⩾H-log(H+1)-Hlog(1+1/H). This bound improves on previous results. Furthermore, we provide upper bounds on the expected length of the best code as function of H and the most likely source letter probability