Interactive Coding with Small Memory and Improved Rate
Interactive Coding with Small Memory and Improved Rate
In this work, we study two-party interactive coding for adversarial noise, when both parties have limited memory. We show how to convert any adaptive protocol $\Pi$ into a protocol $\Pi'$ that is robust to an $\epsilon$-fraction of adversarial corruptions, not too much longer than $\Pi$, and which uses small space. …