Title :
A lower bound on the expected length of one-to-one codes
Author :
Alon, Noga ; Orlitsky, Alon
Author_Institution :
Raymond & Beverly Sackler Fac. of Exact Sci., Tel Aviv Univ., Israel
fDate :
27 Jun-1 Jul 1994
Abstract :
Shows that the expected length of any one-to-one encoding of a discrete random variable X is at least H(X)-log (H(X)+1)-log e and that this bound is asymptotically achievable
Keywords :
binary sequences; codes; random processes; discrete random variable; expected length; lower bound; one-to-one codes; Communication system control; Entropy; Gold; Information theory; Random variables; USA Councils; Upper bound;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394765
