A context tree weighting algorithm with an incremental context set

作     者：Kawabata, T Willems, FMJ 

作者机构：Univ Electrocommun Dept Informat & Commun Engn Chofu Tokyo 1828585 Japan Eindhoven Univ Technol Dept Elect Engn NL-5600 MB Eindhoven Netherlands 

出 版 物：《IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES》 (电子信息通信学会汇刊：电子学、通信及计算机科学基础)

年 卷 期：2000年第E83A卷第10期

页      面：1898-1903页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：universal source coding data compression contest tree weighting incremental contest set Lempel-Ziv parsing 

摘      要：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.