To refer to this page use:
|Abstract:||We study coding schemes for multiparty interactive communication over synchronous networks that suffer from stochastic noise, where each bit is independently flipped with probability ε. We analyze the minimal overhead that must be added by the coding scheme to succeed in performing the computation despite the noise. Our main result is a lower bound on the communication of any noise-resilient protocol over a synchronous star network with n parties (where all parties communicate in every round). Specifically, we show a task that can be solved by communicating T bits over the noise-free network, but for which any protocol with success probability of 1-o(1) must communicate at least Ω (T /log n log log n) bits when the channels are noisy. By a 1994 result of Rajagopalan and Schulman, the slowdown we prove is the highest one can obtain on any topology, up to a log log n factor. We complete our lower bound with a matching coding scheme that achieves the same overhead; thus, the capacity of (synchronous) star networks is Θ (log log n/log n). Our bounds prove that, despite several previous coding schemes with rate Ω (1) for certain topologies, no coding scheme with constant rate Ω (1) exists for arbitrary n-party noisy networks.|
|Citation:||Braverman, Mark, Klim Efremenko, Ran Gelles, and Bernhard Haeupler. "Constant-Rate Coding for Multiparty Interactive Communication Is Impossible." Journal of the ACM 65, no. 1 (2017): pp. 4:1-41. doi:10.1145/3050218|
|Type of Material:||Journal Article|
|Journal/Proceeding Title:||Journal of the ACM|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.