Bounds on expansion in LZ'77-like coding

Abstract

We investigate the maximum increase in number of phrases that results from changing one symbol in a string that has been parsed using an LZ'77-like algorithm. We provide upper and lower bounds to the maximum expansion as a function of the position of the changed symbol and of the string length.