–
Coffee and Check-in
–
List Decoding of Tanner and Expander Amplified Codes from Distance Certificates
Shashank Srivastava (TTI Chicago)
–
Break
–
Gilbert and Varshamov meet Johnson: List Decoding Nearly-Optimal Binary Codes
Silas Richelson (UC Riverside)
–
Eclipse (but don't look up!)
()
–
Lunch (on your own)
–
The Hermitian Trace Code
Amnon Ta-Shma (Tel-Aviv University)
–
Break
–
Binary Error Correcting Codes with Minimal Noiseless Feedback
Rachel Zhang (Massachusetts Institute of Technology)
–
Reception
–
What Can and What Cannot Be Done by LP and SDP (An Incomplete Overview)
Alexander Barg (University of Maryland)
–
Coffee and Check-in
–
Constant Query Local Decoding Against Deletions Is Impossible
Meghal Gupta (UC Berkeley)
–
Break
–
Binary Codes with Resilience Beyond 1/4 via Interaction
Klim Efremenko (Ben Gurion University)
–
Lunch (on your own)
–
Signal, if you can’t (for the damage)
Ran Gelles (Bar-Ilan University)
–
Break
–
Dual of (evaluation) codes
Hiram Lopez (Virginia Tech)
–
Coffee and Check-in
–
Codes with the multiplication property
Irit Dveer Dinur (Weizmann Institute)
–
Break
–
Coding Theory in Almost Linear Time and Sublinear Space
Dana Moshkovitz (University of Texas at Austin)
–
Lunch (on your own)
–
Relaxed Local Correctability from Local Testing
Vinayak Kumar (University of Texas at Austin), Geoffrey Mon (University of Texas at Austin)
–
Break
–
Asymptotically-Good RLCCs with (log n)^{2+o(1)} Queries
Tal Yankovitz (Weizmann Institute of Science)
–
Speed Talks
–
Coffee and Check-in
–
Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
Prahladh Harsha (Tata Institute of Fundamental Research)
–
Break
–
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
Peter Manohar (Carnegie Mellon University)
–
Lunch (on your own)
–
Tree codes
Gil Cohen (Tel Aviv University)
–
Break
–
List-decoding random code ensembles
Ray Li (UC Berkeley)
–
Coffee and Check-in
–
Higher-Order MDS Codes
Sivakanth Gopi (Microsoft Research)
–
Break
–
Parameterized Inapproximability of the Minimum Distance Problem over all Fields (and the Shortest Vector Problem in all l_p Norms)
Venkatesan Guruswami (UC Berkeley)
–
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
Omar Alrabiah (UC Berkeley)