On the temporal HZY compression scheme

Z. Cohen; Y. Matias; S. Muthukrishnan; S. C. Sahinalp

On the temporal HZY compression scheme

Z. Cohen, Y. Matias, S. Muthukrishnan, S. C. Sahinalp

Research output: Contribution to conference › Paper › peer-review

Abstract

The HZY compression scheme is a context-based compression method. It is a one-pass algorithm as the codeword of a given block T[(k-1)β+1:kβ] depends only on the `past'. Analysis of this scheme shows that on any input generated by a stationary ergodic source, the output of the temporal HZY scheme converges to the conditional entropy of the source. No other one-pass compression scheme is known to be optimal under this refined notion of information content.

Original language	English (US)
Pages	185-186
Number of pages	2
State	Published - 2000
Event	11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: Jan 9 2000 → Jan 11 2000

Other

Other	11th Annual ACM-SIAM Symposium on Discrete Algorithms
City	San Francisco, CA, USA
Period	1/9/00 → 1/11/00

ASJC Scopus subject areas

Software
General Mathematics

Cite this

@conference{af08f18a02404213acb9e7959a5a27e8,

title = "On the temporal HZY compression scheme",

abstract = "The HZY compression scheme is a context-based compression method. It is a one-pass algorithm as the codeword of a given block T[(k-1)β+1:kβ] depends only on the `past'. Analysis of this scheme shows that on any input generated by a stationary ergodic source, the output of the temporal HZY scheme converges to the conditional entropy of the source. No other one-pass compression scheme is known to be optimal under this refined notion of information content.",

author = "Z. Cohen and Y. Matias and S. Muthukrishnan and Sahinalp, {S. C.}",

year = "2000",

language = "English (US)",

pages = "185--186",

note = "11th Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 09-01-2000 Through 11-01-2000",

}

TY - CONF

T1 - On the temporal HZY compression scheme

AU - Cohen, Z.

AU - Matias, Y.

AU - Muthukrishnan, S.

AU - Sahinalp, S. C.

PY - 2000

Y1 - 2000

N2 - The HZY compression scheme is a context-based compression method. It is a one-pass algorithm as the codeword of a given block T[(k-1)β+1:kβ] depends only on the `past'. Analysis of this scheme shows that on any input generated by a stationary ergodic source, the output of the temporal HZY scheme converges to the conditional entropy of the source. No other one-pass compression scheme is known to be optimal under this refined notion of information content.

AB - The HZY compression scheme is a context-based compression method. It is a one-pass algorithm as the codeword of a given block T[(k-1)β+1:kβ] depends only on the `past'. Analysis of this scheme shows that on any input generated by a stationary ergodic source, the output of the temporal HZY scheme converges to the conditional entropy of the source. No other one-pass compression scheme is known to be optimal under this refined notion of information content.

UR - http://www.scopus.com/inward/record.url?scp=0033873491&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033873491&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0033873491

SP - 185

EP - 186

T2 - 11th Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 9 January 2000 through 11 January 2000

ER -

On the temporal HZY compression scheme

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this