Another look at universal data compression
J. Ziv, Y. Hershkovitz · 2002
Non-asymptotic coding and converse theorems are derived for universal data-compression algorithms in cases where the training sequence ("history") that is available to the encoder is not large enough so as to yield the ultimate compression ratio, namely the entropy of the source.>