Seminar • Algorithms and Complexity • New Codes on High Dimensional Expanders
Please note: This seminar will take place in M3 4206 and online.
Rachel Yun Zhang, PhD student
CSAIL, Massachusetts Institute of Technology
A code, which is a set of strings called codewords, is locally testable if one can test whether a given word is close to a codeword by reading only a few bits. Locally testable codes have been studied since the 1990s as key ingredients in the construction of probabilistically checkable proofs.