A universal algorithm for sequential data compression (1977)
by
Jacob Ziv
,
Abraham Lempel
| Venue: | IEEE TRANSACTIONS ON INFORMATION THEORY |
| Citations: | 965 - 4 self |
BibTeX
@ARTICLE{Ziv77auniversal,
author = {Jacob Ziv and Abraham Lempel},
title = {A universal algorithm for sequential data compression},
journal = {IEEE TRANSACTIONS ON INFORMATION THEORY},
year = {1977},
volume = {23},
number = {3},
pages = {337--343}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
Citations
| 1105 | Information theory and reliable communication - Gallager - 1968 |
| 773 | A method for the construction of minimum-redundancy codes - Huffman - 1952 |
| 176 | On the complexity of finite sequences - Lempel, Ziv - 1976 |
| 65 | Universal noiseless coding - Davisson - 1980 |
| 32 | Minimum-redundancy coding for the discrete noiseless channel, IRETrans.Inform - Karp - 1961 |
| 17 | Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters - Perl, Garey, et al. - 1975 |
| 17 | Coding of sources with unknown statistics–I: Probability of encoding error - Ziv - 1972 |
| 10 | An algorithm for optimal prefix parsing of a noiseless and memoryless channel - Lempel, Even, et al. - 1973 |
| 6 | Optimal Coding in the Case of Unknown and Changing Message Statistics, Probl - Fitingof - 1965 |
| 3 | On Variable Length to Block Coding - SCHNEIDER - 1972 |
| 1 | Optimal variable length codes - Varn - 1971 |
| 1 | An algorithm for optimal prefix parsing of a noiseless and memoryless channel - ACM - 1975 |
