1977•IEEE Transactions on Information TheoryRequires access

A universal algorithm for sequential data compression

J. Ziv, A. Lempel

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5503 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Data compression, Algorithm, Compression (physics), Computer science, Compression ratio, Block (permutation group theory), Variable (mathematics), Universal code