Title :
New bounds on the expected length of one-to-one codes
Author :
Blundo, Carlo ; De Prisco, Roberto
Author_Institution :
Dipartimento di Inf. ed Applicazioni, Salerno Univ., Italy
fDate :
1/1/1996 12:00:00 AM
Abstract :
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
Keywords :
binary sequences; codes; entropy; probability; code length; discrete random variable; entropy; expected length; one to one codes; source letter probability; upper bounds; Algebra; Councils; Distributed computing; Encoding; Entropy; Lagrangian functions; Probability distribution; Random variables;
Journal_Title :
Information Theory, IEEE Transactions on
