2 papers
cs.IT2025
List-Recovery of Random Linear Codes over Small Fields
Dean Doron, Jonathan Mosheiff, Nicolas Resch +1
We study list-recoverability of random linear codes over small fields, both from errors and from erasures. We consider codes of rate -close to capacity, and aim to bound the dep…
cs.IT2024
Interactive Coding with Small Memory and Improved Rate
Dorsa Fathollahi, Bernhard Haeupler, Nicolas Resch +1
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 $…