YouTube25 Apr 2024
43m

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

Podcast cover

Simons Institute

Open in Podwise to generate AI notes

Sign in to process this episode and unlock summaries, transcripts, highlights and translations.

Open in Podwise

Shownotes are not generated by Podwise.

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