تقرير
Interactive Coding with Small Memory and Improved Rate
العنوان: | Interactive Coding with Small Memory and Improved Rate |
---|---|
المؤلفون: | Fathollahi, Dorsa, Haeupler, Bernhard, Resch, Nicolas, Wootters, Mary |
سنة النشر: | 2024 |
المجموعة: | Computer Science Mathematics |
مصطلحات موضوعية: | Computer Science - Information Theory |
الوصف: | 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. More precisely, if $\Pi$ requires space $\log(s)$ and has $|\Pi|$ rounds of communication, then $\Pi'$ requires $O_\epsilon(\log s \log |\Pi|)$ memory, and has $$|\Pi'| = |\Pi|\cdot\left( 1 + O\left( \sqrt{ \epsilon \log \log 1/\epsilon } \right)\right)$$ rounds of communication. The above matches the best known communication rate, even for protocols with no space restrictions. |
نوع الوثيقة: | Working Paper |
URL الوصول: | http://arxiv.org/abs/2408.06541 |
رقم الأكسشن: | edsarx.2408.06541 |
قاعدة البيانات: | arXiv |
الوصف غير متاح. |