Gil I. Shamir, Neri Merhav  Home/Search
Context Related
| ee.technion.ac.il/people/merha...p47.ps 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: ee.technion.ac.il/~merhav/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Three strongly sequential, lossless compression schemes, one with linearly growing per-letter computational complexity, and two with fixed per-letter complexity, are presented and analyzed for memoryless sources with abruptly changing statistics. The first method, which improves on Willems' weighting approach, asymptotically achieves a lower bound on the redundancy, and hence is optimal. The second scheme achieves redundancy of O (log N=N) when the transitions in the statistics are large,... (Update)
Context of citations to this paper: More
...of non stationary sources. One example of such a class is that of memoryless sources with piecewise xed letter probabilities [8] 9] [16] [17] 19] 20] namely, sources for which the probability mass function (PMF) is subjected to occasional abrupt changes. This model...
...non stationary sources. One example of such a class is that of memoryless sources with piecewise xed letter probabilities [8] 9] 16] [17], 19] 20] namely, sources for which the probability mass function (PMF) is subjected to occasional abrupt changes. This model and its...
Cited by: More
Universal Lossless Source Coding With the Burrows.. - Effros.. (2002) (Correct)
Asymptotically Optimal Threshold Based Low Complexity.. - Shamir, Costello (1999) (Correct)
Asymptotically Optimal Low Complexity Sequential Lossless.. - Shamir, Costello, Jr. (1999) (Correct)
Similar documents (at the sentence level):
77.6%: Low Complexity Sequential Lossless Coding for Piecewise.. - Shamir, Merhav (1999) (Correct)
Active bibliography (related documents): More All
0.4: An Optimal DNA Segmentation Based on the MDL Principle - Szpankowski, Ren, Szpankowski (2003) (Correct)
0.2: A Competitive Neyman-Pearson Approach to Universal Hypothesis .. - Levitan, Merhav (2000) (Correct)
0.2: The Method Of Types And Lossy Data-Embedding - Kokes, Gibson, Orsak, Stolpman (2000) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: Asymptotically Optimal Low Complexity Sequential.. - Shamir, Costello, Merhav (1999) (Correct)
0.5: Universal Lossless Compression of Switching Sources - Shamir, Costello, Jr. (2000) (Correct)
0.2: On Successive Refinement for the Wyner-Ziv Problem - Steinberg, Merhav (2003) (Correct)
Related documents from co-citation: More All
7: Coding for a binary Independent Piecewise-Identically-Distributed source (context) - Willems - 1996
5: The Context-Tree Weighting Method: Basic properties - Willems, Shtarkov et al. - 1995
5: The performance of universal encoding (context) - Krichevsky, Trofimov - 1981
BibTeX entry: (Update)
G. I. Shamir and N. Merhav, \Low complexity sequential lossless coding for piecewise stationary memoryless sources," to appear in the July 1999 issue of IEEE Trans. Inform. Theory . http://citeseer.ist.psu.edu/shamir99low.html More
@misc{ shamir99low,
author = "G. Shamir and N. Merhav",
title = "Low complexity sequential lossless coding for piecewise stationary memoryless
sources",
text = "G. I. Shamir and N. Merhav, \Low complexity sequential lossless coding
for piecewise stationary memoryless sources, to appear in the July 1999
issue of IEEE Trans. Inform. Theory .",
year = "1999",
url = "citeseer.ist.psu.edu/shamir99low.html" }
Citations (may not include all citations):2319 Elements of Information Theory (context) - Cover, Thomas - 1991
458 A universal algorithm for sequential data compression - Ziv, Lempel - 1977
293 Compression of individual sequences via variable-rate coding - Ziv, Lempel - 1978
163 Principles and Practice of Information Theory (context) - Blahut - 1991
91 The Context-Tree weighting method: basic properties - Willems, Shtarkov et al. - 1995
78 Universal coding, information, prediction, and estimation (context) - Rissanen - 1984
68 Entropy and Information Theory - Gray - 1990
66 Information Theory: Coding Theorems for Discrete Memoryless .. (context) - Csiszar, Korner - 1981
45 Dynamic Huffman coding (context) - Knuth - 1985
44 Variations on a theme by Huffman (context) - Gallager - 1978
41 The performance of universal encoding (context) - Krichevsky, Trofimov - 1981
37 Design and analysis of dynamic Huffman codes - Vitter - 1987
34 A strong version of the redundancy-capacity theorem of unive.. (context) - Merhav, Feder - 1995
27 Arithmetic coding for data compression - Howard, Vitter - 1994
15 Probabilistic Information Theory (context) - Jelinek - 1968
15 The sliding-window Lempel-Ziv algorithm is asymptotically op.. (context) - Wyner, Ziv - 1994
13 Coding for a binary Independent Piecewise-Identically-Distri.. (context) - Willems - 1996
13 Asymptotically Optimal Classification for Multiple Tests wit.. (context) - Gutman - 1989
8 Multi-alphabet universal coding of memoryless sources (context) - Shtarkov, Tjalkens et al. - 1995
7 On classification with empirically observed statistics and u.. (context) - Ziv - 1988
5 the minimum description length principle for sources with pi.. (context) - Merhav - 1993
2 Coding for binary piecewise memoryless sources (context) - Willems - 1994
2 An improvement of dynamic Huffman coding with a simple repet.. (context) - Yokoo - 1991
2 Weighted coding methods for binary piecewise memoryless sour.. (context) - Willems, Casadei - 1995
2 Live-and-die coding for binary piecewise i.i.d. sources (context) - Willems, Krom - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-ee.technion.ac.il/~merhav/): More
Hierarchical Universal Coding - Feder, Merhav (1998) (Correct)
Low Complexity Sequential Lossless Coding for Piecewise.. - Shamir, Merhav (1999) (Correct)
On the Amount of Statistical Side Information Required for.. - Merhav, Ziv (1998) (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