High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity (Q4640284): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q644690 |
Changed an Item |
||
| Property / author | |||
| Property / author: Shubhangi Saraf / rank | |||
Normal rank | |||
Revision as of 07:31, 20 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
