A new lower bound for the mean code length of all one-to-one codes for a random variable withnoutcomes is derived. The bound, which is tight, improves an earlier one due to Leung-Yan-Cheong and Cover. Another bound for one-to-one codes for binary information sources is derived.
No takes yet. Share an insight, caveat, or question.
J. Rissanen (1982) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: