Collection Nexus Trimester - 2016 - Distributed Computation and Communication Theme
Organisateur(s)
Date(s)
19/05/2024
Lower bounds for coding for multiparty interactive communication (2)
We study coding schemes for multiparty interactive communication over synchronous networks that suffer from stochastic noise. In the work of Rajagopalan Schuman from 94, it was shown that there exists a coding scheme for any network with slowdown of O(logn). However, until now there was no lower bounds on the rate of coding in networks. In this talk, I will show first lower bound of Ω(logn/loglogn) for coding in star network.
