Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes

Explore a 25-minute IEEE conference talk on deterministic and efficient interactive coding derived from hard-to-decode tree codes, presented by experts Zvika Brakerski from Weizmann Institute, Yael Tauman Kalai from Microsoft and MIT, and Raghuvansh Saxena from Princeton University. Delve into the intricacies of this advanced topic in computer science and cryptography, gaining insights into the latest research and developments in interactive coding techniques.