Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Ziv et al. (Sun,) studied this question.
www.synapsesocial.com/papers/69ff7c794716aad0cc855cae — DOI: https://doi.org/10.1109/tit.1977.1055714
J. Ziv
A. Lempel
IEEE Transactions on Information Theory
Technion – Israel Institute of Technology
Building similarity graph...
Analyzing shared references across papers
Loading...