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.
|Number of pages||2|
|State||Published - 2000|
|Event||11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA|
Duration: 9 Jan 2000 → 11 Jan 2000
|Conference||11th Annual ACM-SIAM Symposium on Discrete Algorithms|
|City||San Francisco, CA, USA|
|Period||9/01/00 → 11/01/00|