Abstract
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
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
