An optimal lower bound for 2-query locally decodable linear codes (Q1045948): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Upper bound on the communication complexity of private information retrieval / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4535072 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds for adaptive locally decodable codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the efficiency of local decoding procedures for error-correcting codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extractors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4440426 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Expander codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank |
Latest revision as of 08:18, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An optimal lower bound for 2-query locally decodable linear codes |
scientific article |
Statements
An optimal lower bound for 2-query locally decodable linear codes (English)
0 references
18 December 2009
0 references
combinatorial problems
0 references
computational complexity
0 references
cryptography
0 references