The Context-Tree Weighting Method : Extensions
暂无分享,去创建一个
[1] David Haussler,et al. Linear size finite automata for the set of all subwords of a word - an outline of results , 1983, Bull. EATCS.
[2] Xiang-dong Hou,et al. The Reed-Muller Code Is Not -Linear for , 1998 .
[3] Aaron D. Wyner,et al. Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression , 1989, IEEE Trans. Inf. Theory.
[4] Frans M. J. Willems,et al. The context-tree weighting method: basic properties , 1995, IEEE Trans. Inf. Theory.
[5] Wojciech Szpankowski,et al. Asymptotic properties of data compression and suffix trees , 1993, IEEE Trans. Inf. Theory.
[6] Paul C. Shields,et al. The ergodic and entropy theorems revisited , 1987, IEEE Trans. Inf. Theory.
[7] Benjamin Weiss,et al. Entropy and data compression schemes , 1993, IEEE Trans. Inf. Theory.
[8] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.
[9] Frans M. J. Willems,et al. Context Tree Weighting : A Sequential Universal Source Coding Procedure for Fsmx Sources , 1993, Proceedings. IEEE International Symposium on Information Theory.
[10] Raphail E. Krichevsky,et al. The performance of universal encoding , 1981, IEEE Trans. Inf. Theory.