DocumentCode
327324
Title
Compressing an incompressible sequence
Author
Aberg, Jan ; Volf, Paul ; Willems, Fkans
Author_Institution
Dept. of Inf. Theory, Lund Univ., Sweden
fYear
1998
fDate
16-21 Aug 1998
Firstpage
134
Abstract
We construct a sequence z which, according to the definition by Ziv and Lempel (1978), is incompressible with finite-state encoders, and show that this sequence is nevertheless compressible by the extended context-tree weighting method of Willems (1994)
Keywords
binary sequences; data compression; encoding; trees (mathematics); Ziv-Lempel definition; binary words; compression; extended context-tree weighting method; finite-state encoders; incompressible sequence; Binary sequences; Entropy; Equations; Parity check codes; Tiles;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708725
Filename
708725
Link To Document