BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1798
DTSTAMP:20261109T111317Z
SUMMARY:Efficient Algorithmic Decoding of Algebraic and Expander Codes
DESCRIPTION:Speaker: Ashutosh Shankar (TIFR)\n\nAbstract: \nAlgorithmic dec
 oding is the problem of efficiently decoding a corrupted received word\, t
 o obtain the closest codeword or a list of all nearby codewords. An error-
 correcting code\, however theoretically good\, is only of practical use if
  it has efficient decoding algorithms. In my thesis I describe efficient d
 ecoding algorithms for several algebraic codes and expander codes.\n \nI 
 will describe (1) A unique-decoding algorithm for Multivariate Multiplicit
 y codes\, (2) Algorithms for list-decoding and list-recovery of Univariate
  Multiplicity codes that run in nearly linear time\, and (3) A simple algo
 rithm to decode Sipser-Spielman codes approaching the unique-decoding radi
 us. The techniques used include tools from algebra and combinatorics. \n
URL:https://www.tcs.tifr.res.in/web/events/1798
DTSTART;TZID=Asia/Kolkata:20261112T090000
DTEND;TZID=Asia/Kolkata:20261112T100000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR