A universal algorithm for sequential data compression

19775,425 citationsJournal Article

Authors

J. Ziv · Technion – Israel Institute of Technology

A. Lempel · Technion – Israel Institute of Technology

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.

Topics & Keywords

Algorithms and Data Compression Cellular Automata and Applications Advanced Data Compression Techniques

Publication Details

Published in: IEEE Transactions on Information Theory

Volume 23, Issue 3, pp. 337-343

DOI: 10.1109/tit.1977.1055714

Field-Weighted Citation Impact: 7.52

Command Palette

A universal algorithm for sequential data compression

Authors

Abstract

Topics & Keywords

Publication Details