一种利用边信息错位的压缩算法
A Compression Algorithm Using Mis-aligned Side-information
摘要:
我们研究的问题压缩源序列的存在下,边信息是相关的源通过插入,删除和替换。我们提出了一个简单的算法来压缩源序列时,边信息存在于编码器和解码器。该算法的一个关键属性是它分别对不同范围的运行中包含的编辑进行编码。对于小的插入和删除概率,该算法的压缩率是渐近最优的。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。