–
Coffee and Check-In
–
Welcome Address
–
Highly-Efficient Local Proofs And Codes

Noga Ron-Zewi (University of Haifa)
–
Lower Bounds for Constant-Query RLDCs

Elena Grigorescu (University of Waterloo)
–
Break
–
Low-Degree Polynomials Are Good Extractors

Joao Miguel Lourenco Ribeiro (IT and IST - University of Lisbon)
–
Lunch (on your own)
–
Efficient Cryptographic Proofs from RAA Codes

Nicolas Resch (University of Amsterdam)
–
Break
–
Polynomials, Divided Differences, And Codes

Venkitesh Iyer (Tel Aviv University)
–
Reception
–
Coffee and Check-In
–
Limitations Of The Decoding-To-Lpn Reduction Via Code Smoothing

Alexander Barg (University of Maryland)
–
Capacity Via Symmetry: Overview And Outlook

Henry Pfister (Duke University)
–
Break
–
Recovery Of Sparse Binary Vectors From Generalized Linear Measurements

Arya Mazumdar (UC San Diego)
–
Lunch (on your own)
–
An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC

Lalitha Vadlamani (International Institute of Information Technology, Hyderabad)
–
Break
–
Coding Theory For Quantum Error Correction

Gretchen Matthews (Virginia Tech)
–
Coffee and Check-In
–
Explicit Folded Reed-Solomon And Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds

Zihan Zhang (Ohio State University)
–
List Recovery And The Prices Of Linearity

Jonathan Mosheiff (Ben-Gurion University)
–
Break
–
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric

Zeyu Guo (Ohio State University)
–
Lunch (on your own)
–
Coffee and Check-In
–
Explicit Lossless Vertex Expanders

Rachel Zhang (Massachusetts Institute of Technology)
–
Locality Vs Quantum Codes

Ray Li (Santa Clara University)
–
Break
–
PCP-free Inapproximability of Nearest Codeword and Minimum Distance

Xuandi Ren (UC Berkeley)
–
Lunch (on your own)
–
Limitations on the Size of Fault-Tolerant Circuits

Anirudh Krishna (IBM)
–
Break
–
Good Quantum Codes from Tensor Products

Louis Golowich (UC Berkeley)
–
Open Problems
–
Coffee and Check-In
–
On The Performance Of Rs Codes Against Insertions And Deletions

Roni Con (Technion)
–
Robust Gray Codes Approaching The Optimal Rate

Dorsa Fathollahi (Stanford University)
–
Break
–
Private Linear Computation: Fundamental Limits And Efficient Algorithms

Anoosheh Heidarzadeh (Santa Clara University)
–
Lunch (on your own)