Seminar • Algorithms and Complexity • Almost Tight Exponential Lower Bounds for Binary Linear 3-LCCs

Please note: This seminar will take place in DC 2568.

Rafael Oliveira, Professor
David R. Cheriton School of Computer Science

In this talk we will see the recent elegant and near optimal lower bound for 3-LCCs proved by Alrabiah and Guruswami.

The talk will be based on “Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles.”