Pages that link to "Item:Q1947042"
From MaRDI portal
The following pages link to Query-efficient locally decodable codes of subexponential length (Q1947042):
Displaying 12 items.
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes (Q2272981) (← links)
- Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length (Q2947559) (← links)
- Locally Decodable Codes: A Brief Survey (Q3005596) (← links)
- Three query locally decodable codes with higher correctness require exponential length (Q3113729) (← links)
- Towards 3-query locally decodable codes of subexponential length (Q3546358) (← links)
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity (Q5146859) (← links)
- New bounds for matching vector families (Q5495853) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes (Q5738792) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- On the optimal communication complexity of error-correcting multi-server PIR (Q6169550) (← links)