Peter Manohar

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2025

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

Elena Grigorescu, Vinayak M. Kumar, Peter Manohar +1

A locally decodable code (LDC) $C : {0, 1}^{k} \to {0, 1}^{n}$ is an error-correcting code that allows one to recover any bit of the original message with good probability while…

cs.CC2025

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

Oliver Janzer, Peter Manohar

A code $C : {0, 1}^{k} \to {0, 1}^{n}$ is a $q$ -query locally decodable code ( $q$ -LDC) if one can recover any chosen bit $b_{i}$ of the message $b \in {0, 1}^{k}$ with good confide…

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

A kq−2q​ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs

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