The Rate of Interactive Codes Is Bounded Away from 1
Pages 1424 - 1437
Abstract
Kol and Raz [STOC 2013] showed how to simulate any alternating two-party communication protocol designed to work over the noiseless channel, by a protocol that works over a stochastic channel that corrupts each sent symbol with probability є>0 independently, with only a 1+O(√(є)) blowup to the communication. In particular, this implies that the maximum rate of such interactive codes approaches 1 as є goes to 0, as is also the case for the maximum rate of classical error correcting codes. Over the past decade, followup works have strengthened and generalized this result to other noisy channels, stressing on how fast the rate approaches 1 as є goes to 0, but retaining the assumption that the noiseless protocol is alternating.
In this paper we consider the general case, where the noiseless protocols can have arbitrary orders of speaking. In contrast to Kol-Raz and to the followup results in this model, we show that the maximum rate of interactive codes that encode general protocols is upper bounded by a universal constant strictly smaller than 1. To put it differently, we show that there is an inherent blowup in communication when protocols with arbitrary orders of speaking are faced with any constant fraction of errors є > 0. We mention that our result assumes a large alphabet set and resolves the (non-binary variant) of a conjecture by Haeupler [FOCS 2014].
References
[1]
Shweta Agrawal, Ran Gelles, and Amit Sahai. 2016. Adaptive protocols for interactive communication. In International Symposium on Information Theory (ISIT). 595–599.
[2]
Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, and Ofer Shayevitz. 2021. A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels. IEEE Transactions on Information Theory, 67, 12 (2021), 7639–7658.
[3]
Mark Braverman and Anup Rao. 2011. Towards coding for maximum errors in interactive communication. In Symposium on Theory of computing (STOC). 159–166.
[4]
Gil Cohen and Shahar Samocha. 2019. Capacity-Approaching Deterministic Interactive Coding Schemes Against Adversarial Errors. Electronic Colloquium on Computational Complexity: ECCC, 147.
[5]
Klim Efremenko, Elad Haramaty, and Yael Tauman Kalai. 2020. Interactive Coding with Constant Round and Communication Blowup. In Innovations in Theoretical Computer Science Conference (ITCS), Thomas Vidick (Ed.). 151, 7:1–7:34.
[6]
Ran Gelles. 2017. Coding for Interactive Communication: A Survey. Foundations and Trends® in Theoretical Computer Science, 13, 1–2 (2017), 1–157.
[7]
Ran Gelles and Bernhard Haeupler. 2014. Capacity of Interactive Communication over Erasure Channels and Channels with Feedback. In Symposium on Discrete Algorithms (SODA). 1296–1311.
[8]
Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, and Avi Wigderson. 2016. Towards optimal deterministic coding for interactive communication. In Symposium on Discrete Algorithms (SODA). 1922–1936.
[9]
Bernhard Haeupler. 2014. Interactive channel capacity revisited. In Foundations of Computer Science (FOCS). 226–235.
[10]
Bernhard Haeupler, Amirbehshad Shahrasbi, and Ellen Vitercik. 2018. Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. In International Colloquium on Automata, Languages, and Programming (ICALP). 107, 75:1–75:14.
[11]
Bernhard Haeupler and Ameya Velingker. 2017. Bridging the Capacity Gap Between Interactive and One-Way Communication. In Symposium on Discrete Algorithms (SODA). 2123–2142.
[12]
Gillat Kol and Ran Raz. 2013. Interactive channel capacity. In Symposium on Theory of computing (STOC). 715–724.
[13]
Noam Nisan and Avi Widgerson. 1991. Rounds in communication complexity revisited. In Proceedings of the twenty-third annual ACM symposium on Theory of computing. 419–429.
[14]
Denis Pankratov. 2013. On the Power of Feedback in Interactive Channels. Manuscript.
[15]
Leonard J Schulman. 1992. Communication on noisy channels: A coding theorem for computation. In Foundations of Computer Science (FOCS). 724–733.
[16]
Leonard J Schulman. 1993. Deterministic coding for interactive communication. In Symposium on Theory of computing (STOC). 747–756.
[17]
Claude E. Shannon. 2001. Originally appeared in Bell System Tech. J. 27:379–423, 623–656, 1948. A mathematical theory of communication. ACM SIGMOBILE Mobile Computing and Communications Review, 5, 1 (2001. Originally appeared in Bell System Tech. J. 27:379–423, 623–656, 1948), 3–55.
Index Terms
- The Rate of Interactive Codes Is Bounded Away from 1
Recommendations
Interactive Coding for Multiparty Protocols
ITCS '15: Proceedings of the 2015 Conference on Innovations in Theoretical Computer ScienceThe problem of constructing error-resilient interactive protocols was introduced in the seminal works of Schulman (FOCS 1992, STOC 1993). These works show how to convert any two-party interactive protocol into one that is resilient to constant-fraction ...
Interactive error resilience beyond 2/7
STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of ComputingInteractive error correcting codes can protect interactive communication protocols against a constant fraction of adversarial errors, while incurring only a constant multiplicative overhead in the total communication. What is the maximum fraction of ...
Optimal error resilience of adaptive message exchange
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingWe study the error resilience of the message exchange task: Two parties, each holding a private input, want to exchange their inputs. However, the channel connecting them is governed by an adversary that may corrupt a constant fraction of the ...
Comments
Information & Contributors
Information
Published In
June 2023
1926 pages
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 02 June 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
STOC '23
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Upcoming Conference
STOC '25
- Sponsor:
- sigact
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 234Total Downloads
- Downloads (Last 12 months)138
- Downloads (Last 6 weeks)15
Reflects downloads up to 28 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in