Advances in the Theory of Error-Correcting Codes

Program

Error-Correcting Codes: Theory and Practice

Location

Calvin Lab auditorium

Date

Monday, Apr. 8 – Friday, Apr. 12, 2024

Back to calendar

8:45 – 9:15 a.m.

Coffee and Check-in

9:15 – 10 a.m.

List Decoding of Tanner and Expander Amplified Codes from Distance Certificates

Shashank Srivastava (TTI Chicago)

10 – 10:30 a.m.

Break

10:30 – 11:15 a.m.

Gilbert and Varshamov meet Johnson: List Decoding Nearly-Optimal Binary Codes

Silas Richelson (UC Riverside)

11:15 a.m. – 12 p.m.

Eclipse (but don't look up!)

()

12 – 2 p.m.

Lunch (on your own)

2 – 2:45 p.m.

The Hermitian Trace Code

Amnon Ta-Shma (Tel-Aviv University)

2:45 – 3:15 p.m.

Break

3:15 – 4 p.m.

Binary Error Correcting Codes with Minimal Noiseless Feedback

Rachel Zhang (Massachusetts Institute of Technology)

4 – 5 p.m.

Reception

5 – 6 p.m.

What Can and What Cannot Be Done by LP and SDP (An Incomplete Overview)

Alexander Barg (University of Maryland)

8:45 – 9:15 a.m.

Coffee and Check-in

9:15 – 10 a.m.

Constant Query Local Decoding Against Deletions Is Impossible

Meghal Gupta (UC Berkeley)

10 – 10:30 a.m.

Break

10:30 – 11:15 a.m.

Binary Codes with Resilience Beyond 1/4 via Interaction

Klim Efremenko (Ben Gurion University)

11:15 a.m. – 2 p.m.

Lunch (on your own)

2 – 2:45 p.m.

Signal, if you can’t (for the damage)

Ran Gelles (Bar-Ilan University)

2:45 – 3:15 p.m.

Break

3:15 – 4 p.m.

Dual of (evaluation) codes

Hiram Lopez (Virginia Tech)

8:45 – 9:15 a.m.

Coffee and Check-in

9:15 – 10 a.m.

Codes with the multiplication property

Irit Dveer Dinur (Weizmann Institute)

10 – 10:30 a.m.

Break

10:30 – 11:15 a.m.

Coding Theory in Almost Linear Time and Sublinear Space

Dana Moshkovitz (University of Texas at Austin)

11:15 a.m. – 2 p.m.

Lunch (on your own)

2 – 2:45 p.m.

Relaxed Local Correctability from Local Testing

Vinayak Kumar (University of Texas at Austin),
Geoffrey Mon (University of Texas at Austin)

2:45 – 3:15 p.m.

Break

3:15 – 4 p.m.

Asymptotically-Good RLCCs with (log n)^{2+o(1)} Queries

Tal Yankovitz (Weizmann Institute of Science)

4 – 5 p.m.

Speed Talks

8:45 – 9:15 a.m.

Coffee and Check-in

9:15 – 10 a.m.

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes

Prahladh Harsha (Tata Institute of Fundamental Research)

10 – 10:30 a.m.

Break

10:30 – 11:15 a.m.

An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes

Peter Manohar (Carnegie Mellon University)

11:15 a.m. – 2 p.m.

Lunch (on your own)

2 – 2:45 p.m.

Tree codes

Gil Cohen (Tel Aviv University)

2:45 – 3:15 p.m.

Break

3:15 – 4 p.m.

List-decoding random code ensembles

Ray Li (UC Berkeley)

8:45 – 9:15 a.m.

Coffee and Check-in

9:15 – 10 a.m.

Higher-Order MDS Codes

Sivakanth Gopi (Microsoft Research)

10 – 10:30 a.m.

Break

10:30 – 11:15 a.m.

Parameterized Inapproximability of the Minimum Distance Problem over all Fields (and the Shortest Vector Problem in all l_p Norms)

Venkatesan Guruswami (UC Berkeley)

11:15 a.m. – 12 p.m.

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles

Omar Alrabiah (UC Berkeley)