A context-tree weighting method for text generating sources

Summary form only given. The authors discuss context tree weighting (Willems et al. 1995). This was originally introduced as a sequential universal source coding method for the class of binary tree sources. The paper discusses the application of the method to the compaction of ASCII sequences. The estimation of redundancy and model redundancy are also considered.

[1]  Raphail E. Krichevsky,et al.  The performance of universal encoding , 1981, IEEE Trans. Inf. Theory.

[2]  Jorma Rissanen,et al.  Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.

[3]  Frans M. J. Willems,et al.  The context-tree weighting method: basic properties , 1995, IEEE Trans. Inf. Theory.

[4]  Meir Feder,et al.  A universal finite memory source , 1995, IEEE Trans. Inf. Theory.