BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Rachel Zhang (MIT)
DTSTART:20220303T230000Z
DTEND:20220303T234500Z
DTSTAMP:20260423T035415Z
UID:SPAMS/11
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SPAMS/11/">I
 nteractive Error Correcting Codes</a>\nby Rachel Zhang (MIT) as part of MI
 T Simple Person's Applied Mathematics Seminar\n\nLecture held in Room: 2 -
  132 in the Simons Building.\n\nAbstract\nConsider the task of communicati
 ng a message x to a receiver in an error resilient way. Classically\, erro
 r correcting codes provide a non-interactive solution to this problem: the
  sender can simply encode x using an error correcting code\, so that even 
 if a constant fraction of the bits are adversarially corrupted\, the recei
 ver can still correctly learn x. In this talk\, I will define the notion o
 f an interactive error correcting code and show that over a binary alphabe
 t\, they can tolerate more adversarial erasures than can (non-interactive)
  error correcting codes. This is joint work with Meghal Gupta and Yael Tau
 man Kalai.\n
LOCATION:https://researchseminars.org/talk/SPAMS/11/
END:VEVENT
END:VCALENDAR