Locally decodable codes
From MaRDI portal
Recommendations
Cited in
(50)- Locally Decodable Codes
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
- Locally decodable and updatable non-malleable codes and their applications
- On the probe complexity of local computation algorithms
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- High-entropy dual functions over finite fields and locally decodable codes
- Public key locally decodable codes with short keys
- Conical Kakeya and Nikodym sets in finite fields
- Succinct arguments for RAM programs via projection codes
- Locally decodable codes for edit distance
- Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
- Algebraic hierarchical locally recoverable codes with nested affine subspace recovery
- Locally verifiable signature and key aggregation
- scientific article; zbMATH DE number 7754310 (Why is no real title available?)
- On the power of relaxed local decoding algorithms
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
- A novel elementary construction of matching vectors
- Local correction of juntas
- Outlaw distributions and locally decodable codes
- scientific article; zbMATH DE number 7561748 (Why is no real title available?)
- Efficient Construction of Rigid Matrices Using an NP Oracle
- Relaxed locally correctable codes
- Codes with local decoding procedures
- Smooth and strong PCPs
- High-rate codes with sublinear-time decoding
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
- Spanoids -- an abstraction of spanning structures, and a barrier for LCCs
- Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists)
- High-entropy dual functions and locally decodable codes (extended abstract)
- List-decodable Byzantine robust PIR: lower communication complexity, higher Byzantine tolerance, smaller list size
- Scalable multi-server private information retrieval
- Relaxed locally correctable codes
- Relaxed locally correctable codes with improved parameters
- Sampling correctors
- Local correctability of expander codes
- Locally decodable codes: a brief survey
- Identifying generalized Reed-Muller codewords by quantum queries
- Reed-Muller Codes
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Linear relaxed locally decodable and correctable codes do not need adaptivity and two-sided error
- Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
- Hermitian-lifted codes
- Locally decodable quantum codes
- Zero-knowledge RAM: doubly efficient and black-box
- Small even covers, locally decodable codes and restricted subgraphs of edge-colored Kikuchi graphs
- Locality via partially lifted codes
- Lifted projective Reed-Solomon codes
- Efficient construction of rigid matrices using an NP oracle
- Locally recoverable codes from rational maps
- Nearly optimal pseudorandomness from hardness
This page was built for publication: Locally decodable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891400)
