Universal data compression and repetition times

Frans M J Willems

doi:10.1109/18.42176

Universal data compression and repetition times

Frans M J Willems

Research output: Contribution to journal › Article › Academic › peer-review

14 Citations (Scopus)

2 Downloads (Pure)

Abstract

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 language	English
Pages (from-to)	54-58
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	35
Issue number	1
DOIs	https://doi.org/10.1109/18.42176
Publication status	Published - 1 Jan 1989

Access to Document

10.1109/18.42176

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

Cite this

@article{830d3343ba664a21a4c3c752de28501e,

title = "Universal data compression and repetition times",

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

author = "Willems, {Frans M J}",

year = "1989",

month = jan,

day = "1",

doi = "10.1109/18.42176",

language = "English",

volume = "35",

pages = "54--58",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "1",

}

TY - JOUR

T1 - Universal data compression and repetition times

AU - Willems, Frans M J

PY - 1989/1/1

Y1 - 1989/1/1

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

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

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

U2 - 10.1109/18.42176

DO - 10.1109/18.42176

M3 - Article

AN - SCOPUS:84941434809

VL - 35

SP - 54

EP - 58

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -

Universal data compression and repetition times

Abstract

Access to Document

Other files and links

Cite this