Title :
A universal algorithm for sequential data compression
Author :
Ziv, Jacob ; Lempel, Abraham
fDate :
5/1/1977 12:00:00 AM
Abstract :
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.
Keywords :
Sequential coding; Source coding; Books; Compression algorithms; Data compression; Data processing; Displays; Information theory; Jacobian matrices; Telephony; Testing; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1977.1055714
