Answers are grounded in this paper and cite their sources.
A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable-to-block codes designed to match a completely specified source.
No takes yet. Share an insight, caveat, or question.
Ziv et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: