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

Noga Alon; Alon Orlitsky

doi:10.1109/ISIT.1994.394765

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

Noga Alon
, Alon Orlitsky

School of Computer Science and AI

Lucent

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

16 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
Title of host publication	Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	203
Number of pages	1
ISBN (Print)	0780320158, 9780780320154
DOIs	https://doi.org/10.1109/ISIT.1994.394765
State	Published - 1994
Event	1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway Duration: 27 Jun 1994 → 1 Jul 1994

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/Territory	Norway
City	Trondheim
Period	27/06/94 → 1/07/94

Access to Document

10.1109/ISIT.1994.394765

Cite this

@inproceedings{7e1c55a9f5984cdd9563b23919bd76e3,

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 = "Noga Alon and Alon Orlitsky",

year = "1994",

doi = "10.1109/ISIT.1994.394765",

language = "אנגלית",

isbn = "0780320158",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "203",

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

address = "ארצות הברית",

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

}

Alon, N & Orlitsky, A 1994, A lower bound on the expected length of one-to-one codes. in Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994., 394765, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 203, 1994 IEEE International Symposium on Information Theory, ISIT 1994, Trondheim, Norway, 27/06/94. https://doi.org/10.1109/ISIT.1994.394765

A lower bound on the expected length of one-to-one codes. / Alon, Noga; Orlitsky, Alon.
Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994. Institute of Electrical and Electronics Engineers Inc., 1994. p. 203 394765 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

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

AU - Alon, Noga

AU - Orlitsky, Alon

PY - 1994

Y1 - 1994

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 - https://www.scopus.com/pages/publications/84894294092

U2 - 10.1109/ISIT.1994.394765

DO - 10.1109/ISIT.1994.394765

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84894294092

SN - 0780320158

SN - 9780780320154

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 203

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

PB - Institute of Electrical and Electronics Engineers Inc.

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

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this