Universal coding of zipf distributions

Yoav Freund, Alon Orlitsky, Prasad Santhanam, Junan Zhang

Research output: Contribution to journalConference articlepeer-review


The universal coding of Zipf distributions are discussed. Coding schemes whose redundancy increases slower than n are known as universal. The universal coding scheme can be considered as an algorithm for combining expert advice whose code length is equal to the cumulative log loss and the redundancy is the difference between the loss of the combining algorithm and the loss of the best expert. When compressing natural-language text, it is reasonable to code the text a word at a time, thereby relying on the distribution of the words. One approach to reduce the redundancy in that case would be to restrict the collection of possible distributions over the words.

Original languageEnglish (US)
Pages (from-to)736-737
Number of pages2
JournalLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
StatePublished - 2003
Externally publishedYes
Event16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003 - Washington, DC, United States
Duration: Aug 24 2003Aug 27 2003

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Universal coding of zipf distributions'. Together they form a unique fingerprint.

Cite this