Abstract: (coming soon)

Bio: Anjana A M is currently an Assistant Professor in the Department of Electrical Engineering at IIT Hyderabad. Prior to joining academia, she served as a Chief Engineer at Samsung R&D Institute India - Bangalore, where she was part of the Advanced Modem team developing PHY-layer algorithms for beyond 5G communication systems. Her industry experience also includes roles at Qualcomm India Private Limited and Lekha Wireless Solutions, Bangalore, where she primarily worked on 4G and 5G modem systems.

Anjana received her Ph.D. from the Department of ECE at the Indian Institute of Science (IISc), Bangalore, where she worked under the guidance of Prof. B. Sundar Rajan. Her research was partly funded by the Qualcomm Innovation Fellowship awarded to her in 2020. She also holds a Master's degree in Telecommunication from the Dept. of ECE, IISc, where she graduated as the gold medalist.

Abstract: Can the $n$-party broadcast channel, where any symbol sent by one party is received by all, be made resilient to noise with low overhead? Namely, is it possible to construct interactive error-correcting codes that convert any protocol designed for the noiseless broadcast channel into one that works over the noisy broadcast channel and is not much longer than the original protocol?

[EKS18, STOC 2018] showed that such interactive codes with constant multiplicative overhead are possible under the assumption that the noiseless protocol being simulated is non-adaptive, meaning that it is restricted to have a pre-determined order of turns. Their noise resilient simulating protocols, however, require adaptivity, where each party can decide whether or not to broadcast given all the information available to them, including their input and received transcript. The question of whether such a simulation is possible for general, potentially adaptive, noiseless protocols was left open.

We resolve this question negatively, proving that any interactive code that converts adaptive noiseless broadcast protocols into adaptive broadcast protocols resilient to stochastic errors must incur a multiplicative overhead of $\Omega(\log n / \log \log n)$, which is nearly tight.

Bio: Raghuvansh Raj Saxena is a Reader at the School of Technology and Computer Science at the Tata Institute of Fundamental Research, Mumbai. His primary research interest is communication complexity and its applications to other areas of theoretical computer science, such as coding theory, algorithmic game theory, streaming algorithms, and distributed systems. Other topics he likes to think about are computational complexity, information theory, and things you can convince him to think about.

Before joining TIFR, Raghuvansh received his Ph.D. from Princeton University under the amazing supervision of Prof. Gillat Kol and his Bachelor's degree in Computer Science and Engineering from IIT Delhi.

Abstract: (coming soon)

Bio: Arvind is an Assistant Professor at the Department of Electrical Engineering, Indian Institute of Technology Madras, India. He received the B.E. (Hons.) degree in Electronics and Communication Engineering from BITS Pilani University, India, in 2018, and the Ph.D. degree in Electrical Communication Engineering from the Indian Institute of Science (IISc), Bengaluru, in 2023, specializing in error-control coding. He then spent a couple of years as a Research Fellow at the Centre of Data for Public Good (CDPG), IISc, where he worked on differential privacy.

Arvind was a recipient of the 2023 IEEE Jack Keil Wolf ISIT Student Paper Award. His papers have also won paper awards at the ACM IKDD CODS, NCC, and the IEEE SPCOM. Arvind's Ph.D. thesis was awarded the Seshagiri Kaikini Medal for the best Ph.D. thesis from the ECE Department at IISc, for the year 2023–24.