Lower bound on the expected length of one-to-one codes

Noga Alon; Alon Orlitsky

Lower bound on the expected length of one-to-one codes

Noga Alon
, Alon Orlitsky

Research output: Contribution to conference › Paper › peer-review

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.

Original language	English (US)
State	Published - 1994
Externally published	Yes
Event	Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994

Other

Other	Proceedings of the 1994 IEEE International Symposium on Information Theory
City	Trodheim, Norw
Period	6/27/94 → 7/1/94

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Cite this

@conference{0f2064bace5445afaa334c054ef058f3,

title = "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.",

author = "Noga Alon and Alon Orlitsky",

year = "1994",

language = "English (US)",

note = "Proceedings of the 1994 IEEE International Symposium on Information Theory ; Conference date: 27-06-1994 Through 01-07-1994",

}

TY - CONF

T1 - Lower bound on the expected length of one-to-one codes

AU - Alon, Noga

AU - Orlitsky, Alon

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0028699947

UR - https://www.scopus.com/pages/publications/0028699947#tab=citedBy

M3 - Paper

AN - SCOPUS:0028699947

T2 - Proceedings of the 1994 IEEE International Symposium on Information Theory

Y2 - 27 June 1994 through 1 July 1994

ER -

Lower bound on the expected length of one-to-one codes

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this