A lower bound on the expected length of one-to-one codes

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.

DOI: 10.1109/18.333891

Statistics

0510'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

57 Citations

Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Alon1994ALB, title={A lower bound on the expected length of one-to-one codes}, author={Noga Alon and Alon Orlitsky}, journal={IEEE Trans. Information Theory}, year={1994}, volume={40}, pages={1670-1672} }