Speaker: Shahar Mozes, Hebrew University
January 5, 2024 11:00 AM
- 12:00 PM
Abstract:
A locally testable code is an error correcting code that has a property-tester who when receiving a word reads q bits of it that are randomly chosen, and rejects the word with probability proportional to its distance from the code. The parameter q is called the locality of the tester. In a joint work with Irit Dinur, Shai Evra, Ron Livne and Alex Lubotzky we construct an infinite family of locally testable codes which have constant rate, constant distance and constant locality.