Efficient Compression of Long Arbitrary Sequences with No Reference at the Encoder

Yuval Cassuto, Jacob Ziv, Stefan M. Moser, Amos Lapidoth
In a distributed information application an encoder compresses an arbitrary vector while a similar reference vector is available to the decoder as side information. For the Hammingdistance similarity measure, and when guaranteed perfect reconstruction is required, we present two contributions to the solution of this problem. One potential application of the results is the compression of DNA sequences, where similar (but not identical) reference vectors are shared among senders and receivers.
doi:10.3929/ethz-b-000402703 fatcat:ejxpojdqfndhrmhehowbbr26ma