Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes

Documenti analoghi

• Relaxed Local Correctability from Local Testing
  di: Kumar, Vinayak M., et al.
  Pubblicazione: (2023)
• Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
  di: Block, Alexander R., et al.
  Pubblicazione: (2026)
• A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
  di: Janzer, Oliver, et al.
  Pubblicazione: (2024)
• Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
  di: Blocki, Jeremiah, et al.
  Pubblicazione: (2021)
• Improved Circuit Lower Bounds and Quantum-Classical Separations
  di: Grewal, Sabee, et al.
  Pubblicazione: (2024)