On families of new adaptive compression algorithms suitable for time-varying source data
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
A fast and efficient nearly-optimal adaptive Fano coding scheme
Information Sciences: an International Journal
| Hi-index | 754.84 |
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