Redundancy of the KrichevskyβTrofimov es
β
Tsutomu Kawabata; Naohisa Tasaki
π
Article
π
2000
π
John Wiley and Sons
π
English
β 223 KB
The KrichevskyTrofimov 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) u (alphabet size