Skip to content

Author

Sidhant Saraogi

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families

Matching Vector families (MVFs) are defined by two ordered lists of vectors in $\mathbb{Z}_m^n$ whose inner products satisfy specific residue patterns modulo an integer $m$. Most famously, restricted MVFs are used to construct the best-known constant-query Locally Decodable codes (LDCs). We prove an upper bound of $2^{...

Sidhant Saraogi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.