arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.03604cs.DS
收藏

最优文档交换和新的插入和删除码

Optimal Document Exchange and New Codes for Insertions and Deletions

Bernhard Haeupler

摘要:

我们给出了第一个通信最优的文件交换协议。对于任何$n$和$k < n$,我们的随机化方案采用任何$n$位文件$F$,并计算$Θ(k \log \frac{n}{k})$位摘要,根据该摘要,可以以高概率重建$F$,给定具有编辑距离$ED(F,F') \leq k$的相关文件$F'$。我们的摘要的大小是$k$的所有值的信息理论顺序最优的,为[Orlitsky; FOCS'91]的长期未决问题提供了随机解决方案。它也是第一个非平凡的解决方案,为有趣的设置,其中一个小的恒定部分的符号已被编辑,产生一个最佳的总结大小$O(H(δ)n)$的$k=δn$。这总结了一长串越来越好的协议,产生更大的总结$k$和次多项式故障概率的次线性值。特别是,最近的突破[Belazzougui,Zhang; FOCS'16]假设$k < n^ε$,产生大小为$O(k\log^2 k + k\log n)$的摘要,并以概率$1-(k \log n)^{-O(1)}$成功。我们也给出了一个有效的去随机化的文件交换协议,摘要大小为$O(k \log^2 \frac{n}{k})$。对于任何$k$,这都优于Belazzougui的摘要大小为$O(k^2 + k \log^2 n)$的确定性文档交换协议。我们的确定性文件交换直接提供了新的有效的系统错误纠正代码的插入和删除。这些(二进制)代码校正对抗性插入/缺失的任何$δ$部分,同时具有$1 - O(δ\log^2 \frac{1}δ)$的比率,并且改进了具有$1 - Θ\left(\sqrtδ \log^{O(1)} \frac{1}ε\right)$比率的Guruswami和Li以及Haeupler、Shahrasbi和Vitercik的代码。

英文摘要:

We give the first communication-optimal document exchange protocol. For any $n$ and $k < n$ our randomized scheme takes any $n$-bit file $F$ and computes a $Θ(k \log \frac{n}{k})$-bit summary from which one can reconstruct $F$, with high probability, given a related file $F'$ with edit distance $ED(F,F') \leq k$. The size of our summary is information-theoretically order optimal for all values of $k$, giving a randomized solution to a longstanding open question of [Orlitsky; FOCS'91]. It also is the first non-trivial solution for the interesting setting where a small constant fraction of symbols have been edited, producing an optimal summary of size $O(H(δ)n)$ for $k=δn$. This concludes a long series of better-and-better protocols which produce larger summaries for sub-linear values of $k$ and sub-polynomial failure probabilities. In particular, the recent break-through of [Belazzougui, Zhang; FOCS'16] assumes that $k < n^ε$, produces a summary of size $O(k\log^2 k + k\log n)$, and succeeds with probability $1-(k \log n)^{-O(1)}$. We also give an efficient derandomized document exchange protocol with summary size $O(k \log^2 \frac{n}{k})$. This improves, for any $k$, over a deterministic document exchange protocol by Belazzougui with summary size $O(k^2 + k \log^2 n)$. Our deterministic document exchange directly provides new efficient systematic error correcting codes for insertions and deletions. These (binary) codes correct any $δ$ fraction of adversarial insertions/deletions while having a rate of $1 - O(δ\log^2 \frac{1}δ)$ and improve over the codes of Guruswami and Li and Haeupler, Shahrasbi and Vitercik which have rate $1 - Θ\left(\sqrtδ \log^{O(1)} \frac{1}ε\right)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑