The Error Resilience of Binary Codes with Interaction

Watch a Computer Science and Discrete Mathematics seminar presentation exploring groundbreaking research in coding theory and error correction, delivered by Princeton University's Gillat Kol at the Institute for Advanced Study. Delve into fundamental questions about the Plotkin bound in coding theory and discover how interactive error-correcting codes can surpass traditional limitations in handling adversarial corruptions. Learn about innovative approaches that challenge the natural 1/8 resilience limit of binary interactive codes through collaborative research findings. Understand the interconnections between single-message transmission systems and interactive protocols in the context of error resilience, based on joint work with Klim Efremenko, Raghuvansh R. Saxena, and Zhijun Zhang.