Jacob Ziv, Abraham Lempel  Home/Search
Context Related
| compression.graphi...rsal_algorithm.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.haifa.ac.il/courses/src_cod... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A universal algorithm for sequential data compres- sion 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. (Update)
Cited by: More
Unknown - (Correct)
Data Compression Algorithms for Energy-Constrained Devices.. - Sadler, Martonosi (2006) (Correct)
Hardware-Software Co-simulation of Bus-Based Reconfigurable.. - Vasudevan (2005) (Correct)
Active bibliography (related documents): More All
0.6: Data Compression - Lelewer, Hirschberg (1987) (Correct)
0.5: Improved Behaviour of Tries by the "Symmetrization" of the.. - Reznik, Szpankowski (Correct)
0.3: Universal Prediction - Merhav, Feder (1998) (Correct)
Similar documents based on text: More All
0.2: Structures of String Matching and Data Compression - Larsson (1999) (Correct)
0.2: Large Deviations With Diminishing Rates - Adam Shwartz Electrical (Correct)
0.2: Attack Of The Mutant Suffix Trees - Larsson (1998) (Correct)
Related documents from co-citation: More All
37: Compression of individual sequences via variable-rate coding - Ziv, Lempel
25: A technique for high-performance data compression (context) - Welch - 1984
18: Text compression (context) - Bell, Cleary et al. - 1990
BibTeX entry: (Update)
Ziv J., Lempel A., "A Universal Algorithm for Sequential Data Compression", IEEE Transactions on Information Theory, Vol. 23, No. 3, pp. 337-343. http://citeseer.ist.psu.edu/ziv77universal.html More
@article{ ziv77universal,
author = "Jacob Ziv and Abraham Lempel",
title = "A Universal Algorithm for Sequential Data Compression",
journal = "IEEE Transactions on Information Theory",
volume = "23",
number = "3",
pages = "337-343",
year = "1977",
url = "citeseer.ist.psu.edu/ziv77universal.html" }
Citations (may not include all citations):338 A method for the construction of minimum-redundancy codes (context) - Huffman - 1952
100 New York: Wiley (context) - Gallager, Theory et al. - 1968
49 the complexity of finite sequences (context) - Lempel, Ziv - 1976
46 Universal noiseless coding (context) - Davisson - 1973
10 Minimum-redundancy coding for the discrete noiseless channel (context) - Karp - 1961
8 Efficient generation of optimal prefix code: Equiprobable wo.. (context) - Perl, Gary et al. - 1975
7 An algorithm for optimal prefix parsing of a noiseless and m.. (context) - Lempel, Even et al. - 1973
5 On variable length to block coding (context) - Jelinek, Schneider - 1972
3 Coding of sources with unknown statistics---Part I; Probabil.. (context) - Ziv - 1972
3 Optimal coding in the case of unknown and changing message s.. (context) - Fitingof - 1966
2 Optimal variable length codes (context) - Varn - 1971
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cs.haifa.ac.il/courses/src_coding/): More
Interval and Recency Rank Source Coding: Two On-Line Adaptive.. - Elias (1987) (Correct)
The Context-Tree Weighting Method: Basic Properties - Willems, Shtarkov, Tjalkens (1995) (Correct)
A New Universal Coding Scheme for the Binary Memoryless Source - Lawrence (1977) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC