Dense Locally Testable Codes Cannot Have Constant Rate and Distance (Q3088121): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Simple PCPs with poly-log rate and query complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Locally Testable Codes Require Redundant Testers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The PCP theorem by gap amplification / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Locally testable codes and PCPs of almost-linear length / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial Construction of Locally Testable Codes / rank | |||
Normal rank |
Latest revision as of 10:18, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Dense Locally Testable Codes Cannot Have Constant Rate and Distance |
scientific article |
Statements
Dense Locally Testable Codes Cannot Have Constant Rate and Distance (English)
0 references
17 August 2011
0 references
0 references