Key points are not available for this paper at this time.
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 (s) and has || rounds of communication, then ' requires O_ (s ||) memory, and has |'| = || (1 + O (1/) ) rounds of communication. The above matches the best known communication rate, even for protocols with no space restrictions.
Fathollahi et al. (Mon,) studied this question.