arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1901.09863cs.DS
收藏

高效的插入、删除和替换多方交互编码

Efficient Multiparty Interactive Coding for Insertions, Deletions and Substitutions

Ran Gelles, Yael T. Kalai, Govind Ramnarayan

摘要:

在交互式编码领域,两方或多方希望在可能有噪声的通信网络上执行分布式计算。最终目标是开发能够容忍高水平噪声同时仅以恒定因子增加通信的有效编码方案(即,恒定速率)。在这项工作中,我们考虑在任意拓扑结构的同步通信网络,在强大的对抗性插入删除噪声模型。也就是说,噪声信道可以反向地改变任何发送的符号的内容,以及完全去除发送的符号或将新的符号注入信道。我们提供了有效的,恒定速率的计划,成功地进行任何计算的概率很高,只要对手腐败最多$\varepsilon /m$部分的总通信,其中$m$是在网络中的链接数和$\varepsilon$是一个小常数。该方案假设各方共享一个随机字符串,对抗性噪声对此不敏感。我们可以去掉这个假设,代价是对$\varepsilon / (m\log m)$对抗性错误具有弹性。虽然以前的工作认为插入删除噪声模型在两方设置,据我们所知,我们的计划是第一个多方计划,是弹性的插入和删除。此外,我们的方案是第一个计算效率高的方案,在多方设置,是弹性对抗噪声。

英文摘要:

In the field of interactive coding, two or more parties wish to carry out a distributed computation over a communication network that may be noisy. The ultimate goal is to develop efficient coding schemes that can tolerate a high level of noise while increasing the communication by only a constant factor (i.e., constant rate). In this work we consider synchronous communication networks over an arbitrary topology, in the powerful adversarial insertion-deletion noise model. Namely, the noisy channel may adversarially alter the content of any transmitted symbol, as well as completely remove a transmitted symbol or inject a new symbol into the channel. We provide efficient, constant rate schemes that successfully conduct any computation with high probability as long as the adversary corrupts at most $\varepsilon /m$ fraction of the total communication, where $m$ is the number of links in the network and $\varepsilon$ is a small constant. This scheme assumes the parties share a random string to which the adversarial noise is oblivious. We can remove this assumption at the price of being resilient to $\varepsilon / (m\log m)$ adversarial error. While previous work considered the insertion-deletion noise model in the two-party setting, to the best of our knowledge, our scheme is the first multiparty scheme that is resilient to insertions and deletions. Furthermore, our scheme is the first computationally efficient scheme in the multiparty setting that is resilient to adversarial noise.

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

↑