Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound

 Computer Science/Discrete Mathematics Seminar I Topic: Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound Speaker: Shubhangi Saraf Affiliation: Rutgers University Date: Monday, November 27 Time/Room: 11:00am - 12:15pm/S-101 Video Link: https://video.ias.edu/csdm/2017/1127-ShubhangiSaraf

We show that there exist binary locally testable codes (for all rates) and locally correctable codes (for low rates) with rate and distance approaching the Gilbert-Varshamov bound (which is the best rate-distance tradeoff known for general binary error-correcting codes). Our constructions use a number of ingredients: Thommesen's random concatenation technique, the Guruswami-Sudan-Indyk strategy for list-decoding concatenated codes, the Alon-Edmonds-Luby distance amplification method, and the local list-decodability and local testability of Reed-Muller codes. Interestingly, this seems to be the first time that local testability is used in the construction of locally correctable codes. Joint work with Sivakanth Gopi, Swastik Kopparty, Rafael Oliveira and Noga Ron-Zewi