Improved lower bounds for 3-query matching vector codes
From MaRDI portal
Cites work
- 3-query locally decodable codes of subexponential length
- A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation
- A quadratic lower bound for three-query linear locally decodable codes over any field
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- scientific article; zbMATH DE number 1332656 (Why is no real title available?)
- scientific article; zbMATH DE number 7650433 (Why is no real title available?)
- Intersection theorems with geometric consequences
- Locally decodable codes
- Lower bounds for linear locally decodable codes and private information retrieval
- Matching vector codes
- New bounds for matching vector families
- On the efficiency of local decoding procedures for error-correcting codes
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- The Shannon capacity of a union
- Towards 3-query locally decodable codes of subexponential length
- Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula>
This page was built for publication: Improved lower bounds for 3-query matching vector codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296629)
