articleTop 10% cited
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory · 1977 · Vol. 23(3) · pp. 337–343
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.
Algorithms and Data CompressionCellular Automata and ApplicationsAdvanced Data Compression TechniquesData compressionAlgorithmCompression (physics)Computer scienceCompression ratioBlock (permutation group theory)Variable (mathematics)Universal codeBlock codeCode (set theory)
Citations
5,424
FWCI
7.49
field-weighted impact
References
11
Percentile
97%
vs. same field & year
Citations per year
Cited by
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory · 1978 · 3,429 citations
The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS
IEEE Transactions on Image Processing · 2000 · 1,619 citations
References
On the Complexity of Finite Sequences
IEEE Transactions on Information Theory · 1976 · 2,712 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.