Interactive Coding with Small Memory and Improved Rate
Dorsa Fathollahi, Bernhard Haeupler, Nicolas Resch, Mary Wootters

TL;DR
This paper presents a method to convert any adaptive interactive protocol into a noise-robust version that uses small memory and maintains near-optimal communication rates, even under adversarial noise.
Contribution
It introduces a transformation that makes protocols resilient to adversarial noise with limited memory, achieving near-optimal communication complexity.
Findings
Protocols can be made robust to adversarial noise with small memory.
The transformed protocol has only a small increase in rounds of communication.
Memory usage is polylogarithmic in the original protocol size.
Abstract
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 into a protocol that is robust to an -fraction of adversarial corruptions, not too much longer than , and which uses small space. More precisely, if requires space and has rounds of communication, then requires memory, and has rounds of communication. The above matches the best known communication rate, even for protocols with no space restrictions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications
