Answers are grounded in this paper and cite their sources.
The amount of fixed side information required for lossless data compression is discussed. Nonasymptotic coding and converse theorems are derived for data-compression algorithms with fixed statistical side information ("training sequence") that 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. (1997) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: