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.
|Number of pages||6|
|Journal||IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences|
|Publication status||Published - 2000|
Kawabata, T., & Willems, F. M. J. (2000). A context tree weighting algorithm with an incremental context set. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E83-A(10), 1898-1903.