High-rate codes with sublinear-time decoding
From MaRDI portal
Publication:5501932
Recommendations
Cites work
- BPP has subexponential time simulations unless EXPTIME has publishable proofs
- 3-query locally decodable codes of subexponential length
- A Geometric Approach to Information-Theoretic Private Information Retrieval
- Algebraic methods for interactive proof systems
- An improved lower bound on the size of Kakeya sets over finite fields
- Automata, Languages and Programming
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- High-Rate Locally Correctable Codes via Lifting
- scientific article; zbMATH DE number 4205986 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 2019623 (Why is no real title available?)
- scientific article; zbMATH DE number 2081120 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Improved low-degree testing and its applications
- IP = PSPACE
- List-decoding multiplicity codes
- Local correctability of expander codes
- Locally decodable codes
- Lower bounds for linear locally decodable codes and private information retrieval
- Matching vector codes
- New affine-invariant codes from lifting
- New generalizations of the Reed-Muller codes--I: Primitive codes
- Non-deterministic exponential time has two-prover interactive protocols
- Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
- On matrix rigidity and locally self-correctable codes
- On the complexity of approximating the diamond norm
- On the efficiency of local decoding procedures for error-correcting codes
- Optimal Rate List Decoding via Derivative Codes
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Pseudorandom generators without the XOR lemma (extended abstract)
- Query-efficient locally decodable codes of subexponential length
- Simple extractors for all min-entropies and a new pseudorandom generator
- Some remarks on multiplicity codes
- Towards 3-query locally decodable codes of subexponential length
Cited in
(20)- On list decoding of certain \(\mathbb{F}_q\)-linear codes
- Simultaneous rational function reconstruction with errors: handling multiplicities and poles
- Lifted projective Reed-Solomon codes
- Fast systematic encoding of multiplicity codes
- List-decoding multiplicity codes
- On the efficiency of local decoding procedures for error-correcting codes
- Some remarks on multiplicity codes
- Outlaw distributions and locally decodable codes
- Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives
- High-rate codes with sublinear-time decoding
- Lifted Multiplicity Codes and the Disjoint Repair Group Property
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
- Decoding of cyclic codes over quaternion integers by modified Berlekamp–Massey algorithm
- Algorithmizing the multiplicity Schwartz-Zippel lemma
- Malicious security for PIR (almost) for free
- Asymptotically-good RLCCs with \((\log n)^{2+o(1)}\) queries
- Explicit time and space efficient encoders exist only with random access
- Local proofs approaching the witness length
- Duals of multiplicity codes
- Scalable multi-server private information retrieval
This page was built for publication: High-rate codes with sublinear-time decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501932)
