High-rate codes with sublinear-time decoding (Q5501932): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q644690
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Shubhangi Saraf / rank
 
Normal rank
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.1145/2629416 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024011363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-degree testing and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3400474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query-efficient locally decodable codes of subexponential length / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matrix rigidity and locally self-correctable codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Vector Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers / 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: Lower bounds for linear locally decodable codes and private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Rate Locally Correctable Codes via Lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: New affine-invariant codes from lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved decoding of Reed-Solomon and algebraic-geometry codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Rate List Decoding via Derivative Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Correctability of Expander Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New generalizations of the Reed-Muller codes--I: Primitive 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: Exponential lower bound for 2-query locally decodable codes via a quantum argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on multiplicity codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3464538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3355236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound on the size of Kakeya sets over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple extractors for all min-entropies and a new pseudorandom generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: IP = PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators without the XOR Lemma (extended abstract) / 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: Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound / 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: Locally Decodable Codes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:12, 10 July 2024

scientific article; zbMATH DE number 6472749
Language Label Description Also known as
English
High-rate codes with sublinear-time decoding
scientific article; zbMATH DE number 6472749

    Statements

    High-rate codes with sublinear-time decoding (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2015
    0 references
    multiplicity codes
    0 references
    derivatives
    0 references
    locally correctable codes
    0 references
    locally decodable codes
    0 references
    polynomials
    0 references
    sublinear-time algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references