BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20220616T120000Z
UID:ed08a1adce7069bf211f08a1443ed675-294
DTSTAMP:19700101T120021Z
DESCRIPTION:Hypergraph expansion, CSPs, and algorithmic decoding of epsilon-balanced codes
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/294/hypergraph-expansion-csps-and-algorithmic-decoding-of-epsilon-balanced-codes/
SUMMARY:We will discuss some new notions of hypergraph expansion, which can be exploited by spectral algorithms, as well as ones based on semidefinite programming hierarchies. These properties lead to new structural characterizations and algorithmic regularity lemmas for hypergraphs, as well as new decoding algorithms for codes based on bias-reduction via direct-sum, such as the breakthrough construction of epsilon-balanced codes by Ta-Shma. (Based on joint work with Vedat Levi Alev, Fernando Granha Jeronimo, Dylan Quintana, and Shashank Srivastava)
<br>
<br>
For more details about the seminar please visit the website at https://www.csa.iisc.ac.in/iisc-msr-seminar/
<br>
<br>
Microsoft Teams Link:
<br>
<a href="https://teams.microsoft.com/l/meetup-join/19%3ameeting_ZGE3NDg5NzktMWQ0Zi00MzFmLTg5OTgtMTMyYWM4MWQyYjI2%40thread.v2/0?context=%7b%22Tid%22%3a%226f15cd97-f6a7-41e3-b2c5-ad4193976476%22%2c%22Oid%22%3a%227c84465e-c38b-4d7a-9a9d-ff0dfa3638b3%22%7d">https://teams.microsoft.com/l/meetup-join/19%3ameeting_ZGE3NDg5NzktMWQ0Zi00MzFmLTg5OTgtMTMyYWM4MWQyYjI2%40thread.v2/0?context=%7b%22Tid%22%3a%226f15cd97-f6a7-41e3-b2c5-ad4193976476%22%2c%22Oid%22%3a%227c84465e-c38b-4d7a-9a9d-ff0dfa3638b3%22%7d</a>
DTSTART:20220616T120000Z
END:VEVENT
END:VCALENDAR