High-rate locally correctable and locally testable codes with sub-polynomial query complexity

Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf

Ben-Gurion University of the Negev, University of Haifa

Research output: Contribution to journal › Article › peer-review

Fingerprint

Dive into the research topics of 'High-rate locally correctable and locally testable codes with sub-polynomial query complexity'. Together they form a unique fingerprint.