High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity (Q4640284)
From MaRDI portal
scientific article; zbMATH DE number 6784071
- High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity |
scientific article; zbMATH DE number 6784071 |
|
Statements
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity (English)
0 references
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity (English)
0 references
17 May 2018
0 references
29 September 2017
0 references
locally correctable codes
0 references
asymptotically good codes
0 references
locally decodable codes
0 references
locally testable codes
0 references
query complexity
0 references
singleton bound
0 references
Zyablov bound
0 references
