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

Oliver Janzer, Peter Manohar. A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024. [doi]

Authors

Oliver Janzer

This author has not been identified. Look up 'Oliver Janzer' in Google

Peter Manohar

This author has not been identified. Look up 'Peter Manohar' in Google