Peter Elias  Home/Search
Context Related
| cs.haifa.ac.il/cou...s87RecencyCode.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: In the schemes presented the encoder maps each message into a codeword in a prefix-free codeword set. In interval encoding the codeword is indexed by the interval since the last previous occurrence of that message, and the codeword set must be countably infinite. In recency rank encoding the codeword is indexed by the number of distinct messages in that interval, and there must be no fewer codewords than messages. The decoder decodes each codeword on receipt. Users need not know message... (Update)
Context of citations to this paper: More
...using any general purpose compression technique. In section 6. 1, we show results for two di erent compression schemes: Move To Front [3, 5] followed by Hu man coding [9] and Gzip (a variant of LZ77 [16] distributed by the Gnu Free Software Foundation) Move To Front performs...
.... (to be encoded by their list position) using the move to front and transpose self organizing list strategies, respectively [BSTW86, E87, R87, HC87]. Systolic array implementations for transpose and move to front compression have been described [SH92, TW89] Related work on...
Cited by: More
Alphabet Permutation for Differentially Encoding Text - Landau, Levi, Skiena (2004) (Correct)
Using Information Theory Approach to Randomness Testing - Ryabko, Monarev (2003) (Correct)
Universal Lossless Source Coding With the Burrows.. - Effros.. (2002) (Correct)
Active bibliography (related documents): More All
0.3: Optimal Encoding of Non-Stationary Sources - Reif, Storer (2001) (Correct)
0.3: Optimal Lossless Compression of a Class of Dynamic Sources - Reif, Storer (1997) (Correct)
0.3: On the Optimality of Parsing in Dynamic Dictionary Based.. - Matias, Sahinalp (1998) (Correct)
Similar documents based on text: More All
0.3: Minimal Codewords and Secret Sharing - Massey (1993) (Correct)
0.3: Text Compression using Recency Rank with Context and Relation to .. - Sadakane (1997) (Correct)
0.3: Text Compression using Recency Rank with Context and Relation to .. - Sadakane (1997) (Correct)
Related documents from co-citation: More All
10: A locally adaptive data compression scheme (context) - Bentley, Sleator et al. - 1986
8: A Universal Algorithm for Sequential Data Compression - Ziv, Lempel
8: Text compression (context) - Bell, Cleary et al. - 1990
BibTeX entry: (Update)
Elias, P. Interval and recency rank source coding: two on-line adaptive variable-length schemes. IEEE Trans. Inform. Theory IT-33, 1 (Jan., 1987), 3--10. http://citeseer.ist.psu.edu/elias87interval.html More
@article{ elias87interval,
author = "Peter Elias",
title = "Interval and Recency Rank Source Coding: Two On-line Adaptive Variable-length Schemes",
journal = "IEEE Transactions on Information Theory",
volume = "33",
number = "1",
year = "1987",
url = "citeseer.ist.psu.edu/elias87interval.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1973
488 Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985
293 Compression of individual sequences via variable-rate coding - Ziv, Lempel - 1978
228 A technique for high-performance data compression (context) - Welch - 1984
49 the complexity of finite sequences (context) - Lempel, Ziv - 1976
32 Linear algorithm for data compression via string matching (context) - Rodeh, Even - 1981
13 A universal algorithm for data compression (context) - Ziv, Lempel - 1977
12 Coding theorems for individual sequences (context) - Ziv - 1978
10 Parallel algorithms for data compression (context) - onzalez, Storer - 1985
9 An upper bound on the entropy series (context) - Wyner - 1972
9 Economical encoding of commas between strings (context) - Even, Rodeh - 1978
6 IEEE Trans (context) - Universal, representations et al. - 1975
5 Variations on a theme by Lempel and Ziv (context) - Miller, Wegman
3 Minimum times and memories needed to compute the values of a.. (context) - Elias - 1974
1 Variations on a theme by Huffman (context) - allager - 1978
1 An almost optimal algorithm foJ unbounded searching (context) - Bentley, Yao - 1976
1 A source matching approad to finding minimax codes (context) - Davisson, Leon-Garcia - 1980
1 IEEE Tram (context) - Minimax, codeword - 1983
1 Minimax codes for finite alphabets (context) - ssanen - 1978
1 An adaptive system for data compression (context) - Failer - 1973
1 On self-organizing search heuristics (context) - vest - 1976
1 The redundancy and decceleration of a separative encoding of.. (context) - Levenstein - 1968
1 A local13 adaptive data compression scheme (context) - Bentley, Sleator et al. - 1984
1 Design and analysis of dynamic Huffman coding (context) - itter - 1985
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
A Universal Algorithm for Sequential Data Compression - Ziv, Lempel (1977) (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