Pages that link to "Item:Q2637284"
From MaRDI portal
The following pages link to A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284):
Displaying 8 items.
- Locally decodable codes and the failure of cotype for projective tensor products (Q691556) (← links)
- On coset leader graphs of structured linear codes (Q1985294) (← links)
- Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length (Q2947559) (← 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)
- Outlaw distributions and locally decodable codes (Q4638069) (← links)
- On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits (Q5422493) (← links)