Lower bounds for coding for multiparty interactive communication 2/2
150 views · Published 25 February 2016 · 49:29 · Indexed 6 November 2026
Channel: Institut Henri Poincaré · 2016 · Science & Technology
By Klim Efremenko (Tel-Aviv University) Abstract: 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.
More from this channel
-
29:47
10 ans du Groupe Calcul : Histoire du Calcul - Introduction
-
52:14
Gauss, Jacobi, Seidel, Richardson, Krylov: the Invention of Iterative Methods
-
55:33
Les "invariants arithmétiques" de H. Poincaré
-
1:08:53
Henri Poincaré, a founding father of the modern theory of PDEs
-
57:13
Sympletic topology from Poincaré to Gromov
-
57:35
Structural Realism, Then and Now
-
46:26
Poincaré inequalities in probability and geometric analysis
-
1:02:05
On the contributions of Henri Poincaré to modern geophysics...