BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1497
DTSTAMP:20241128T084509Z
SUMMARY:Unbounded error correcting codes
DESCRIPTION:Speaker: Eeshan Modak (TIFR)\n\nAbstract: \nEfremenko and Zamir
  introduce a variant of error correcting codes (ECC) with no predetermined
  length. An unbounded ECC with rate R and distance ε is an encoding of a
  (possibly infinite) message into a (possibly infinite) codeword\, such th
 at for every large enough k we may recover the first Rk symbols of the me
 ssage from the first k symbols of the codeword. In this talk\, we study th
 e performance of linear codes in the unbounded setting.\n \nThis talk is 
 based on this recent paper: https://arxiv.org/abs/2411.04803\n
URL:https://www.tcs.tifr.res.in/web/events/1497
DTSTART;TZID=Asia/Kolkata:20241129T160000
DTEND;TZID=Asia/Kolkata:20241129T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR