Redundancy of the Krichevsky-Trofimov estimator with a finite window for a Markov source
Tsutomu Kawabata, Naohisa Tasaki · Electronics and Communications in Japan (Part III Fundamental Electronic Science) · 2000
The Krichevsky–Trofimov estimator can be implemented as an arithmetic data compressor based on a finite window. We analyze the redundancy of this estimator for the Markov source of finite order. The per-letter redundancy behaves with near certainty as (the number of effective states) × (alphabet size)/2 (window size) when the window size is large. Our analysis applies the renewal theory. © 2000 Scripta Technica, Electron Comm Jpn Pt 3, 83(11): 56–62, 2000