Skip to content

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 Oct 2026

An Improved Johnson Bound for List-Decoding with Hints

This paper studies when list-decodability guarantees for error-correcting codes of good distance can go beyond the classical Johnson radius and gives a corresponding efficient list-decoding algorithm for Reed-Solomon codes up to this new radius. The Johnson bound shows that any error-correcting code with distance $\del...

S. Kopparty, Harry Sha · 0 citations

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