Abstract
Coding for interactive communication augments coding theory to the interactive setting: instead of communicating a message from a sender to a receiver, here the parties are involved in an interactive conversation. Coding schemes allow the parties to complete their conversation despite noise added by the channel. Similar to the unidirectional case, good coding schemes can withstand a large amount of noise and succeed with high probability, while adding only a small amount of redundant information. We aim at giving a comprehensive view on the foundations of coding for interactive communication. In particular, we review basic features of coding schemes in the interactive setting, and survey the main techniques used in designing such schemes. Furthermore, we survey recent developments in interactive coding schemes, and their applications to other related fields.
| Original language | English |
|---|---|
| Pages (from-to) | 1-157 |
| Number of pages | 157 |
| Journal | Foundations and Trends in Theoretical Computer Science |
| Volume | 13 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - 2017 |
Bibliographical note
Publisher Copyright:© 2017 R. Gelles.
Funding
I would like to thank Mark Braverman, Keren Censor-Hillel, Bernhard Haeupler, Jieming Mao, Anup Rao, and Leonard Schulman for invaluable comments on a preliminary version of this manuscript and insightful discussions. I would like to thank Mark also for clarifying and simplifying the tree code construction in Section 3.1.1 and for his continuous support. This work is supported in part by NSF grant No. CCF-1149888, and in part by the Israel Science Foundation (ISF) via grant No. 1078/17.
| Funders | Funder number |
|---|---|
| National Science Foundation | CCF-1149888 |
| Israel Science Foundation | 1078/17 |