A context tree weighting algorithm with an incremental context set

T. Kawabata, F.M.J. Willems

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)

Abstract

We propose a variation of the Context Tree Weighting algorithm for tree source modified such that the growth of the context resembles Lempel-Ziv parsing. We analyze this algorithm, give a concise upper bound to the individual redundancy for any tree source, and prove the asymptotic optimality of the data compression rate for any stationary and ergodic source.
Original languageEnglish
Pages (from-to)1898-1903
Number of pages6
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE83-A
Issue number10
Publication statusPublished - 2000

Fingerprint Dive into the research topics of 'A context tree weighting algorithm with an incremental context set'. Together they form a unique fingerprint.

  • Cite this