A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11390-012-1254-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144581009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander 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: Lower bounds for linear locally decodable codes and private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of Coding Theory in Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally decodable codes and private information retrieval schemes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bound for 2-query locally decodable codes via a quantum argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corruption and Recovery-Efficient Locally Decodable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-query locally decodable codes of subexponential length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards 3-query locally decodable codes of subexponential length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Vector Codes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:55, 7 July 2024

scientific article
Language Label Description Also known as
English
A quadratic lower bound for three-query linear locally decodable codes over any field
scientific article

    Statements

    A quadratic lower bound for three-query linear locally decodable codes over any field (English)
    0 references
    0 references
    11 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    error-correcting code
    0 references
    complexity theory
    0 references
    lower bound
    0 references
    0 references