High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity (Q5361830): Difference between revisions
From MaRDI portal
Item:Q5361830
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1504.05653 / rank | |||
Normal rank |
Revision as of 20:30, 19 April 2024
scientific article; zbMATH DE number 6784071
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
29 September 2017
0 references
locally correctable codes
0 references
locally decodable codes
0 references
locally testable codes
0 references
singleton bound
0 references
Zyablov bound
0 references
query complexity
0 references