CiteSeerX — A universal algorithm for sequential data compression

A universal algorithm for sequential data compression (1977) [801 citations — 3 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@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

Bookmarks

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

846	Information Theory and Reliable Communication – Gallager - 1968
615	A Method for Construction of Minimum-Redundancy Codes – Huffman - 1952
134	On the Complexity of Finite Sequences – Lempel, Ziv - 1976
57	Universal noiseless coding – Davisson - 1973
29	Minimum-redundancy coding for the discrete noiseless channel – Karp - 1961
15	Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters – Perl, Garey, et al. - 1975
11	Coding of sources with unknown statistics—Part II: Distortion relative to a fidelity criterion – Ziv - 1972
10	An algorithm for optimal prefix parsing of a noiseless and memoryless channel – Lempel, Cohen - 1973
4	Optimal Coding in the Case of Unknown and Changing Message Statistics, Probl – Fitingof - 1965
3	On variable length to block coding – Jelinek, Schneider - 1972
1	Optimal variable length codes – Varn - 1971
1	An algorithm for optimal prefix parsing of a noiseless and memoryless channel – ACM - 1975