具有换位的块编辑错误:确定性文档交换协议和几乎最优二进制码
Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes
摘要:
文件交换和纠错码是通信中的两个基本问题。在第一个问题中,Alice和Bob各自持有一根字符串,目标是Alice向Bob发送一个简短的草图,以便Bob可以恢复Alice的字符串。在第二个问题中,Alice通过一个可以添加对抗性错误的通道向Bob发送一条带有一些冗余信息的消息,目标是Bob在错误的情况下正确地恢复消息。在最近的工作\cite{CJLW18}中,作者构造了具有几乎最优参数的显式确定性文档交换协议和编辑错误的二进制纠错码。不幸的是,\cite{CJLW18}中的构造不适用于其他常见错误,如块换位。在本文中,我们推广了\cite{CJLW18}中的结构,以处理更大类的错误。这些包括插入和删除的突发,以及块换位。具体来说,我们考虑文件交换和纠错码的块插入,块删除,和块换位的总数是最多$k \leq αn/\log n$为一些常数$0<α<1$。此外,对于某个常数$0<β<1$,前两种操作插入和删除的比特总数最多为$t \leq βn$,其中$n$是Alice的字符串或消息的长度。我们构造明确的,确定性的文件交换协议与草图大小$ O( (k \log n +t) \log^2 \frac{n}{k\log n + t} )$和明确的二进制纠错码与$O(k \log n \log \log \log n+t)$冗余位。
英文摘要:
Document exchange and error correcting codes are two fundamental problems regarding communications. In the first problem, Alice and Bob each holds a string, and the goal is for Alice to send a short sketch to Bob, so that Bob can recover Alice's string. In the second problem, Alice sends a message with some redundant information to Bob through a channel that can add adversarial errors, and the goal is for Bob to correctly recover the message despite the errors. In a recent work \cite{CJLW18}, the authors constructed explicit deterministic document exchange protocols and binary error correcting codes for edit errors with almost optimal parameters.\ Unfortunately, the constructions in \cite{CJLW18} do not work for other common errors such as block transpositions. In this paper, we generalize the constructions in \cite{CJLW18} to handle a much larger class of errors. These include bursts of insertions and deletions, as well as block transpositions. Specifically, we consider document exchange and error correcting codes where the total number of block insertions, block deletions, and block transpositions is at most $k \leq αn/\log n$ for some constant $0<α<1$. In addition, the total number of bits inserted and deleted by the first two kinds of operations is at most $t \leq βn$ for some constant $0<β<1$, where $n$ is the length of Alice's string or message. We construct explicit, deterministic document exchange protocols with sketch size $ O( (k \log n +t) \log^2 \frac{n}{k\log n + t} )$ and explicit binary error correcting code with $O(k \log n \log \log \log n+t)$ redundant bits.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。