Bounds on expansion in LZ'77-like coding

@article{Castelli2004BoundsOE,
  title={Bounds on expansion in LZ'77-like coding},
  author={Vittorio Castelli and Luis Alfonso Lastras-Monta{\~n}o},
  journal={International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.},
  year={2004},
  pages={58-}
}
We investigate the maximum increase in number of phrases that results from changing k consecutive symbols in a string x having length n parsed using an LZ'77-like algorithm. We consider a class of compression algorithms that partition a sequence into a collection y of nonoverlapping, variable-length phrases and encode them. Each phrase either is a singleton… CONTINUE READING