OpenAlex | Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound

Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound

Work

Year: 2018

Type: article

Abstract: One of the most important open problems in the theory of error-correcting codes is to determine the tradeoff between the rate R and minimum distance δ of a binary code. The best known tradeoff is the ... more

Source: IEEE Transactions on Information Theory

Authors Sivakanth Gopi, Swastik Kopparty, Rafael Oliveira, Noga Ron‐Zewi, Shubhangi Saraf

Institutions Princeton University, Rutgers, The State University of New Jersey, University of Haifa

Cites: 26

Cited by: 15

Related to: 10

FWCI: 1.284

Citation percentile (by year/subfield): 86.46

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder National Science Foundation

Grant ID CCF-1350572