Towards 3-query locally decodable codes of subexponential length
From MaRDI portal
Recommendations
- 3-query locally decodable codes of subexponential length
- 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
- A quadratic lower bound for three-query linear locally decodable codes over any field
- A quadratic lower bound for three-query linear locally decodable codes over any field
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Superquadratic lower bound for 3-query locally correctable codes over the reals
Cited in
(62)- 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
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- A general private information retrieval scheme for MDS coded databases with colluding servers
- Local correctability of expander codes
- A quadratic lower bound for three-query linear locally decodable codes over any field
- Robust characterizations of k-wise independence over product spaces and related testing results
- Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length
- Locally decodable codes: a brief survey
- Limits on the Rate of Locally Testable Affine-Invariant Codes
- Matching vector codes
- Three query locally decodable codes with higher correctness require exponential length
- Corruption and Recovery-Efficient Locally Decodable Codes
- Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
- Constructing Ramsey graphs from Boolean function representations
- A novel elementary construction of matching vectors
- 3-query locally decodable codes of subexponential length
- High-entropy dual functions over finite fields and locally decodable codes
- On the power of relaxed local decoding algorithms
- Relaxed locally correctable codes
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
- On the inner product predicate and a generalization of matching vector families
- Multiple correlation sequences not approximable by nilsequences
- Spanoids -- an abstraction of spanning structures, and a barrier for LCCs
- 3-query locally decodable codes of subexponential length
- A combination of testability and decodability by tensor products
- From irreducible representations to locally decodable codes
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Private Locally Decodable Codes
- High-rate codes with sublinear-time decoding
- 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
- Locally Decodable Codes
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR
- On locally decodable codes in resource bounded channels
- 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
- On matrix rigidity and locally self-correctable codes
- Private information retrieval with result verification for more servers
- Near-optimal private information retrieval with preprocessing
- Enumeration and asymptotic analysis of edge-disjoint triangle packings in complete graphs
- 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
- Plinko: single-server PIR with efficient updates via invertible PRFs
- Small even covers, locally decodable codes and restricted subgraphs of edge-colored Kikuchi graphs
- Information-theoretic multi-server private information retrieval with client preprocessing
- Towards practical doubly-efficient private information retrieval
- High-entropy dual functions and locally decodable codes (extended abstract)
- List-decodable Byzantine robust PIR: lower communication complexity, higher Byzantine tolerance, smaller list size
- Multi-server doubly efficient PIR in the classical model and beyond
- Relaxed locally correctable codes with improved parameters
- Two-server private information retrieval in sublinear time and quasilinear space
- Rank-metric separation in irreducible representations of finite groups
This page was built for publication: Towards 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 Q3546358)
