Paper 2021/1481

Interactive Error Correcting Codes Over Binary Erasure Channels Resilient to $>\frac{1}{2}$ Adversarial Corruption

Meghal Gupta, Yael Tauman Kalai, and Rachel Zhang

Abstract

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 $\frac{1}{2}$ of the communicated bits. In this work, we break this $\frac{1}{2}$ barrier by introducing the notion of an interactive error correcting code ($$) and constructing an $$ that is resilient to adversarial erasure of $$ of the total communicated bits. We emphasize that the adversary can corrupt both the sending party and the receiving party, and that both parties' rounds contribute to the adversary's budget. We also prove an impossibility (upper) bound of $$ on the maximal resilience of any binary $$ to adversarial erasures. In the bit flip setting, we prove an impossibility bound of $$.