Asymptotically optimal low complexity sequential lossless coding for regular piecewise stationary memoryless sources

摘要

The lower bound on the redundancy for lossless universal coding of regular memoryless sources with abruptly changing statistics is shown to be achievable using a fixed per-letter computational complexity strongly sequential compression scheme with logarithmic storage complexity.