High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity (Q4640284): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:47, 7 February 2024
scientific article; zbMATH DE number 6869321
| 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 6869321 |
Statements
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity (English)
0 references
17 May 2018
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
