A Compression Algorithm Using Mis-aligned Side-information

TL;DR

This paper introduces a simple compression algorithm that efficiently compresses source sequences with related side-information affected by insertions, deletions, and substitutions, achieving near-optimal rates for low error probabilities.

Contribution

The paper presents a novel compression algorithm that separately encodes edits in runs, demonstrating asymptotic optimality for small error probabilities.

Findings

Achieves asymptotically optimal compression rates for low insertion/deletion probabilities.

Effectively encodes edits in runs of different lengths.

Applicable when side-information is available at both encoder and decoder.

Abstract

We study the problem of compressing a source sequence in the presence of side-information that is related to the source via insertions, deletions and substitutions. We propose a simple algorithm to compress the source sequence when the side-information is present at both the encoder and decoder. A key attribute of the algorithm is that it encodes the edits contained in runs of different extents separately. For small insertion and deletion probabilities, the compression rate of the algorithm is shown to be asymptotically optimal.