Universal data compression and repetition times

Research output: Contribution to journalArticleAcademicpeer-review

14 Citations (Scopus)
2 Downloads (Pure)


A new universal data compression algorithm is described. This algorithm encodes L source symbols at a time. For the class of binary stationary sources, its rate does not exceed [formula omitted] [formula omitted] bits per source symbol. In our analysis, a property of repetition times turns out to be of crucial importance.

Original languageEnglish
Pages (from-to)54-58
Number of pages5
JournalIEEE Transactions on Information Theory
Issue number1
Publication statusPublished - 1 Jan 1989


Dive into the research topics of 'Universal data compression and repetition times'. Together they form a unique fingerprint.

Cite this