| Title: |
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Swastik Kopparty |
-
Rutgers University, Department of Mathematics
-
Rutgers University, Department of Computer Science
|
| Or Meir |
-
Weizmann Institute of Science, Department of Computer Science and Applied Mathematics
|
| Noga Ron-Zewi |
-
Institute for Advanced Study, School of Mathematics
-
Rutgers University, DIMACS
|
| Shubhangi Saraf |
-
Rutgers University, Department of Mathematics
-
Rutgers University, Department of Computer Science
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1253886,
1412958,
1445755,
1350572
|
| DBLP Key: |
conf/stoc/KoppartyMRS16
|
| Author Comments: |
|