3-query locally decodable codes of subexponential length
From MaRDI portal
Recommendations
- 3-query locally decodable codes of subexponential length
- Towards 3-query locally decodable codes of subexponential length
- Query-efficient locally decodable codes of subexponential length
- Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length
- Three query locally decodable codes with higher correctness require exponential length
Cited in
(44)- Towards breaking the exponential barrier for general secret sharing
- Query-efficient locally decodable codes of subexponential length
- Private information retrieval with sublinear online time
- Single-server private information retrieval with sublinear amortized time
- Secure computation with preprocessing via function secret sharing
- A general private information retrieval scheme for MDS coded databases with colluding servers
- Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length
- Three query locally decodable codes with higher correctness require exponential length
- Towards 3-query locally decodable codes of subexponential length
- Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
- High-entropy dual functions over finite fields and locally decodable codes
- On the power of relaxed local decoding algorithms
- Relaxed locally correctable codes
- The space complexity of mirror games
- Erasures vs. errors in local decoding and property testing
- On the inner product predicate and a generalization of matching vector families
- Lower bounds for approximate LDCs
- 3-query locally decodable codes of subexponential length
- Outlaw distributions and locally decodable codes
- From irreducible representations to locally decodable codes
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Relaxed locally correctable codes
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
- On the modulo degree complexity of Boolean functions
- Erasures versus errors in local decoding and property testing
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- Lower bounds for (batch) PIR with private preprocessing
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
- On the optimal communication complexity of error-correcting multi-server PIR
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
- Improved polynomial secret-sharing schemes
- Near-optimal private information retrieval with preprocessing
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- On the degree of Boolean functions as polynomials over \(\mathbb{Z}_m\)
- Asymptotically-good RLCCs with \((\log n)^{2+o(1)}\) queries
- On the relaxed LDC of BGHSV: a survey that corrects the record
- On the lower bound on the length of relaxed locally decodable codes
- High-entropy dual functions and locally decodable codes (extended abstract)
- Simplified PIR and CDS protocols and improved linear secret-sharing schemes
- Relaxed locally correctable codes with improved parameters
- Violating constant degree hypothesis requires breaking symmetry
- On the definition of malicious private information retrieval
- Two-server private information retrieval in sublinear time and quasilinear space
This page was built for publication: 3-query locally decodable codes of subexponential length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910581)
