Locally Testable Codes with Constant Rate, Distance, and Locality, Part I - Irit Dinur

This course on locally testable codes with constant rate, distance, and locality aims to teach the concept of locally testable codes (LTCs) and their efficient membership testing. The course explores the construction of LTCs with constant relative distance and rate, which can be tested with a constant number of queries. The course covers topics such as the structure of LTCs, high-dimensional expansion, and the construction of LTCs using a left-right Cayley complex. The intended audience for this course includes individuals interested in coding theory, error-correcting codes, and discrete mathematics. The teaching method involves lectures and discussions on the theoretical aspects of LTCs and their practical implications.