Asymptotically optimal low complexity sequential lossless codingfor regular piecewise stationary memoryless sources

摘要

The lower bound on the redundancy for lossless universal coding ofregular memoryless sources with abruptly changing statistics is shown tobe achievable using a fixed per-letter computational complexity stronglysequential compression scheme with logarithmic storage complexity