Sorry, you need to enable JavaScript to visit this website.

On Random Editing in LZ-End

Citation Author(s):
Daniel Roodt, Ulrich Speidel, Vimal Kumar, Ryan K. L. Ko
Submitted by:
Daniel Roodt
Last updated:
25 February 2021 - 6:15pm
Document Type:
Poster
Document Year:
2021
Event:
DCC 2021
Presenters:
Daniel Roodt
Categories:
Other
Keywords:
Data Compression
 

LZ-End is a variant of the LZ77 compression algorithm which allows random access to the compressed data. In this paper, we show how the random-access capability of LZ-End allows random edits to the compressed data, which is the first algorithm to randomly edit strings compressed by a Lempel-Ziv algorithm.

up
0 users have voted:

Comments

Submitted by Dominik Koeppl on 9 March 2021 - 7:36am

Thanks for the talk. Your approach embedding yourself into the slide presentation looks very sophisticated (and maybe complicated?).
Nevertheless, I've a small question regarding the upper bound on the edit on the LZ-End parsing with a sliding window:
I think that you meant $l$ to be the length of the decoded string within the sliding window where the edit took place.
Otherwise, if $l$ is the entire string length, then there is no dependency on the sliding window size.

CITE

QUESTIONS?