AI Chat AI Image Generator AI Video Text to Speech

A Self-contained Analysis of the Lempel-Ziv Compression Algorithm

10/02/2019

∙

by Madhu Sudan, et al.

∙

∙

This article gives a self-contained analysis of the performance of the Lempel-Ziv compression algorithm on (hidden) Markovian sources. Specifically we include a full proof of the assertion that the compression rate approaches the entropy rate of the chain being compressed.

Madhu Sudan
27 publications
David Xiang
1 publication

page 1

page 2

page 3

page 4

research

∙ 10/11/2019

A Proof of Levi's Extension Lemma

We give a short and self-contained proof of Levi's Extension Lemma for p...

0 Marcus Schaefer, et al. ∙

research

∙ 01/03/2020

Moser-Tardos resampling algorithm, entropy compression method and the subset gas

We establish a connection between the entropy compression method and the...

0 Paula M. S. Fialho, et al. ∙

research

∙ 09/21/2022

Downward Self-Reducibility in TFNP

A problem is downward self-reducible if it can be solved efficiently giv...

0 Prahladh Harsha, et al. ∙

research

∙ 12/02/2019

Proof of Dudley's Convex Approximation

We provide a self contained proof of a result of Dudley [Dud64] which sh...

0 Sariel Har-Peled, et al. ∙

research

∙ 08/20/2020

A Simple Proof of Optimal Approximations

The fundamental result of Li, Long, and Srinivasan on approximations of ...

0 Monika Csikos, et al. ∙

research

∙ 10/28/2020

Attribution Preservation in Network Compression for Reliable Network Interpretation

Neural networks embedded in safety-sensitive applications such as self-d...

5 Geondo Park, et al. ∙

research

∙ 12/09/2022

Graph theoretical models and algorithms of portfolio compression

In portfolio compression, market participants (banks, organizations, com...

0 Mihály Péter Hanics, et al. ∙