Query-efficient locally decodable codes of subexponential length (Q1947042): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
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: General constructions for information-theoretic private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377733 / 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: Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits / 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: Q3395988 / 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: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs / 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: Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers / 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: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4046212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal lower bound for 2-query locally decodable linear codes / 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: Q5690489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Approach to Information-Theoretic Private Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards 3-query locally decodable codes of subexponential length / rank
 
Normal rank

Latest revision as of 08:13, 6 July 2024

scientific article
Language Label Description Also known as
English
Query-efficient locally decodable codes of subexponential length
scientific article

    Statements

    Query-efficient locally decodable codes of subexponential length (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 April 2013
    0 references
    locally decodable codes
    0 references
    Mersenne numbers
    0 references
    private information retrieval
    0 references

    Identifiers