On the performance of recency-rank and block-sorting universal lossless data compression algorithms
Jun Muramatsu · IEEE Transactions on Information Theory · 2002
Bounds on the redundancy of the recency-rank and block-sorting universal lossless data compression algorithms for finite-length sequences are presented. These algorithms are asymptotically optimal for infinite-length sequences, stationary ergodic sources in the almost-sure sense, and asymptotically mean stationary sources in the average and almost-sure sense.