Madhu Sudan

collaborators

2 papers

cs.CC2026

Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR

JarosÅaw BÅasiok, Paul Lou, Alon Rosen +1

In the noisy $k$ -XOR problem, one is given $y \in F_{2}^{M}$ and must distinguish between $y$ uniform and $y = A x + e$ , where $A$ is the adjacency matrix of a $k$ -left-regula…

cs.CC2024

Improved PIR Schemes using Matching Vectors and Derivatives

Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan

In this paper, we construct new t-server Private Information Retrieval (PIR) schemes with communication complexity subpolynomial in the previously best known, for all but finitely…