Title :
A lower bound on the expected length of one-to-one codes
Author :
Alon, Noga ; Orlitsky, Alon
Author_Institution :
Dept. of Math., Tel Aviv Univ., Israel
fDate :
9/1/1994 12:00:00 AM
Abstract :
We show 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 :
codes; encoding; random processes; discrete random variable; expected code length; lower bound; one-to-one codes; one-to-one encoding; Block codes; Convolutional codes; Digital communication; Entropy; Erbium; Information theory; Iron; Notice of Violation; Random variables; Viterbi algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
