Abstract:
This paper investigates 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...Show MoreMetadata
Abstract:
This paper investigates 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.
Date of Conference: 27 June 2004 - 02 July 2004
Date Added to IEEE Xplore: 10 January 2005
Print ISBN:0-7803-8280-3