This is the authors' abstract. We don't add key points for this paper.
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 Hamming-distance similarity measure, and when guaranteed perfect reconstruction is required, we present two contributions to the solution of this problem. One result shows that when a set of potential reference vectors is available to the encoder, lower compression rates can be achieved when the set satisfies a certain clustering property. Another result reduces the best known decoding complexity from exponential in the vector lengthntoO(n1.5)by generalized concatenation of inner coset codes and outer error-correcting codes. 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.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Cassuto et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: