A Universal Algorithm for Sequential Data Compression
Ziv J., Lempel A.
IEEE Trans. Inform. Theory. – 1977. – Vol 23, N 3. – P. 337–343.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.
سال:
1977
زبان:
english
صفحات:
7
فائل:
PDF, 481 KB
IPFS:
,
english, 1977