Nonasymptotic coding and converse theorems are derived for universal data compression algorithms in cases where the training sequence ("history") that is available to the encoder consists of the most recent segment of the input data string that has been processed, but is not large enough so as to yield the ultimate compression, namely, the entropy of the source.
No takes yet. Share an insight, caveat, or question.
Hershkovits et al. (1998) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: