BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1242
DTSTAMP:20230914T125956Z
SUMMARY:Searching valiantly for LTCs
DESCRIPTION:Speaker: Ashutosh Shankar (TIFR\, Mumbai.)\n\nAbstract: \nA des
 irable property for a code is "local testability" - being able to look at 
 a small number of locations and determine if the received word is a codewo
 rd or far from one. Given two base codes\, one can construct a tensor code
 : matrices with rows in one code\, and columns in the other. A natural loc
 al test for this would be to randomly pick a row or column and check if it
  is in that base code. Unfortunately\, this fails - we will look at a neat
  counterexample by Paul Valiant (2005). However\, if one of the codes is "
 smooth"\, the test works. Time permitting\, we will look at the definition
  of smoothness (later relaxed to "weakly smooth") and a sketch of the anal
 ysis in that case.\n
URL:https://www.tcs.tifr.res.in/web/events/1242
DTSTART;TZID=Asia/Kolkata:20220930T160000
DTEND;TZID=Asia/Kolkata:20220930T170000
LOCATION:A201
END:VEVENT
END:VCALENDAR