Positive Rate Binary Interactive Error Correcting Codes Resilient to $>\frac12$ Adversarial Erasures

Meghal Gupta, Rachel Zhang

备注：: arXiv admin note: text overlap with arXiv:2111.04181

英文摘要：

An interactive error correcting code ($\mathsf{iECC}$) is an interactive protocol with the guarantee that the receiver can correctly determine the sender's message, even in the presence of noise. This generalizes the concept of an error correcting code ($\mathsf{ECC}$), which is a non-interactive $\mathsf{iECC}$ that is known to have erasure resilience capped at $\frac12$. The work of \cite{GuptaTZ21} constructed the first $\mathsf{iECC}$ resilient to $> \frac12$ adversarial erasures. However, their $\mathsf{iECC}$ has communication complexity quadratic in the message size. In our work, we construct the first positive rate $\mathsf{iECC}$ resilient to $> \frac12$ adversarial erasures. For any $ε> 0$, our $\mathsf{iECC}$ is resilient to $\frac6{11} - ε$ adversarial erasures and has size $O_ε(n)$.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Interactive Error Correcting Codes Over Binary Erasure Channels Resilient to $>\frac12$ Adversarial Corruption

An error correcting code ($\mathsf{ECC}$) allows a sender to send a message to a receiver such that even if a constant fraction of the communicated bits are corrupted, the receiver can still learn the message correctly. Due to their importance and fundamental nature, $\mathsf{ECC}$s have been extensively studied, one of the main goals being to maximize the fraction of errors that the $\mathsf{ECC}$ is resilient to. For adversarial erasure errors (over a binary channel) the maximal error resilience of an $\mathsf{ECC}$ is $\frac12$ of the communicated bits. In this work, we break this $\frac12$…

2021-11-07cs.DScs.ITmath.IT

Erasure-Resilient Property Testing

Property testers form an important class of sublinear algorithms. In the standard property testing model, an algorithm accesses the input function via an oracle that returns function values at all queried domain points. In many realistic situations, the oracle may be unable to reveal the function values at some domain points due to privacy concerns, or when some of the values get erased by mistake or by an adversary. We initiate a study of property testers that are resilient to the presence of adversarially erased function values. An alpha-erasure-resilient epsilon-tester for a property P is g…

2016-07-20cs.CCcs.DMcs.DS

Erasure-Resilient Sublinear-Time Graph Algorithms

We investigate sublinear-time algorithms that take partially erased graphs represented by adjacency lists as input. Our algorithms make degree and neighbor queries to the input graph and work with a specified fraction of adversarial erasures in adjacency entries. We focus on two computational tasks: testing if a graph is connected or $\varepsilon$-far from connected and estimating the average degree. For testing connectedness, we discover a threshold phenomenon: when the fraction of erasures is less than $\varepsilon$, this property can be tested efficiently (in time independent of the size of…

2020-11-29cs.DMcs.DS

Interactive coding resilient to an unknown number of erasures

We consider distributed computations between two parties carried out over a noisy channel that may erase messages. Following a noise model proposed by Dani et al. (2018), the noise level observed by the parties during the computation in our setting is arbitrary and a priori unknown to the parties. We develop interactive coding schemes that adapt to the actual level of noise and correctly execute any two-party computation. Namely, in case the channel erases $T$ transmissions, the coding scheme will take $N+2T$ transmissions using an alphabet of size $4$ (alternatively, using $2N+4T$ transmissio…

2019-09-15cs.DS

Binary Error-Correcting Codes with Minimal Noiseless Feedback

In the setting of error-correcting codes with feedback, Alice wishes to communicate a $k$-bit message $x$ to Bob by sending a sequence of bits over a channel while noiselessly receiving feedback from Bob. It has been long known (Berlekamp, 1964) that in this model, Bob can still correctly determine $x$ even if $\approx \frac13$ of Alice's bits are flipped adversarially. This improves upon the classical setting without feedback, where recovery is not possible for error fractions exceeding $\frac14$. The original feedback setting assumes that after transmitting each bit, Alice knows (via feedbac…

2022-12-13cs.DScs.ITmath.IT

Synchronization Strings and Codes for Insertions and Deletions -- a Survey

Already in the 1960s, Levenshtein and others studied error-correcting codes that protect against synchronization errors, such as symbol insertions and deletions. However, despite significant efforts, progress on designing such codes has been lagging until recently, particularly compared to the detailed understanding of error-correcting codes for symbol substitution or erasure errors. This paper surveys the recent progress in designing efficient error-correcting codes over finite alphabets that can correct a constant fraction of worst-case insertions and deletions. Most state-of-the-art results…

2021-01-03cs.DMcs.DScs.IT

更多相关论文收起更多论文

交互式纠错码最大错误弹性的新上界

A New Upper Bound on the Maximal Error Resilience of Interactive Error-Correcting Codes

本研究改进了交互式纠错码的错误弹性上界，证明其无法容忍超过13/47（约0.2766）的错误比例，优于此前已知的2/7上界。

2023-05-07cs.DS

在线擦除存在下的次线性时间计算

Sublinear-Time Computation in the Presence of Online Erasures

本文开创了在线对抗性擦除模型下的次线性时间算法研究，证明函数线性性和二次性在常数擦除数下仍可测试，并给出线性性测试的紧查询复杂度 Θ(log t)，同时发现有序性和 Lipschitz 性质即使在 t=1 时也无法测试。

2024-12-31cs.DMcs.DS

Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation

We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with high probability and for the remaining queries, the decoder with high probability either answers correctly or declares "don't know." Furthermore, if there is no noise on the data structure, it answers all queries correctly with high probability. Our model is the common generalization of a model proposed recently by de Wolf and the notion of "relaxed locally decodable codes" developed in the PCP literature. We measure…

2010-01-27cs.DS

The Optimal Error Resilience of Interactive Communication Over Binary Channels

In interactive coding, Alice and Bob wish to compute some function $f$ of their individual private inputs $x$ and $y$. They do this by engaging in a non-adaptive (fixed order, fixed length) protocol to jointly compute $f(x,y)$. The goal is to do this in an error-resilient way, such that even given some fraction of adversarial corruptions to the protocol, both parties still learn $f(x,y)$. In this work, we study the optimal error resilience of such a protocol in the face of adversarial bit flip or erasures. While the optimal error resilience of such a protocol over a large alphabet is well unde…

2021-11-05cs.DS