Abstract
About a year-and-a-half ago, two sets of researchers (Dinur-Evra-Livne-Lubotzky-Mozes and Pantaleev-Kalachev) surprised the coding theory community by constructing an explicit family of c^3 locally testable codes; codes with constant relative distance, constant rate and testable with a constant number of queries. In this talk, we will take a deep-dive into the DELLM construction and look at some of the ingredients that go into the building of such codes.