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

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

2016
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
Kopparty, S., Meir, O., Ron-Zewi, N. & Saraf, S., 19 Jun 2016, STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing. Mansour, Y. & Wichs, D. (eds.). Association for Computing Machinery, p. 202-215 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 19-21-June-2016).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Related research output