A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs

Documenti analoghi

• Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
  di: Block, Alexander R., et al.
  Pubblicazione: (2026)
• Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
  di: Blocki, Jeremiah, et al.
  Pubblicazione: (2021)
• Improved Lower Bounds for all Odd-Query Locally Decodable Codes
  di: Basu, Arpon, et al.
  Pubblicazione: (2024)
• Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
  di: Alrabiah, Omar, et al.
  Pubblicazione: (2024)
• PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
  di: Moradi, Mohsen, et al.
  Pubblicazione: (2024)