New bounds on the expected length of one-to-one codes

C. Blundo, R. De Prisco
1996 IEEE Transactions on Information Theory  
In this correspondence 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) ? H log(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.
doi:10.1109/18.481795 fatcat:eihrufhltnby3du5eezfqssprm