ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound
Article URLs:
Alternative Article URLs:
Authors: Sivakanth Gopi
  • Princeton University, Department of Computer Science
Swastik Kopparty
  • Rutgers University - Piscataway, Department of Mathematics
  • Rutgers University - Piscataway, Department of Computer Science
Rafael Mendes de Oliveira
  • Princeton University, Department of Computer Science
Noga Ron-Zewi
  • Institute for Advanced Study, Princeton, School of Mathematics
  • Rutgers University - Piscataway, DIMACS
Shubhangi Saraf
  • Rutgers University - Piscataway, Department of Mathematics
  • Rutgers University - Piscataway, 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: 1451191, 1523816, 1253886, 1412958, 1445755, 1350572
DBLP Key: conf/soda/GopiKORS17
Author Comments:

Discuss this paper and its artifacts below