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

Noga Mordechai Alon; Alon Orlitsky

doi:10.1109/ISIT.1994.394765

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

Noga Mordechai Alon, Alon Orlitsky

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

13 Scopus citations

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.

Original language	English (US)
Title of host publication	Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1994.394765
State	Published - Dec 1 1994
Externally published	Yes
Event	1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway Duration: Jun 27 1994 → Jul 1 1994

Other

Other	1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/Territory	Norway
City	Trondheim
Period	6/27/94 → 7/1/94

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.1994.394765

Cite this

@inproceedings{6c6b6e257ca14bff9d9d7895da03d9d6,

title = "A lower bound on the expected length of one-to-one codes",

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

author = "Alon, {Noga Mordechai} and Alon Orlitsky",

year = "1994",

month = dec,

day = "1",

doi = "10.1109/ISIT.1994.394765",

language = "English (US)",

isbn = "0780320158",

booktitle = "Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994",

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

}

TY - GEN

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

AU - Alon, Noga Mordechai

AU - Orlitsky, Alon

PY - 1994/12/1

Y1 - 1994/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=84894294092&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84894294092&partnerID=8YFLogxK

U2 - 10.1109/ISIT.1994.394765

DO - 10.1109/ISIT.1994.394765

M3 - Conference contribution

AN - SCOPUS:84894294092

SN - 0780320158

SN - 9780780320154

BT - Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994

T2 - 1994 IEEE International Symposium on Information Theory, ISIT 1994

Y2 - 27 June 1994 through 1 July 1994

ER -

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

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this