Showing cs.ITShow all
3 papers · 1 filter
cs.IT2026
An Improved Johnson Bound for List-Decoding with Hints
Swastik Kopparty, Harry Sha
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…
cs.IT2024
High Rate Multivariate Polynomial Evaluation Codes
Swastik Kopparty, Mrinal Kumar, Harry Sha
The classical Reed-Muller codes over a finite field are based on evaluations of -variate polynomials of degree at most over a product set , for some …
cs.IT2024
Error-Correcting Graph Codes
Swastik Kopparty, Aditya Potukuchi, Harry Sha
In this paper, we construct Error-Correcting Graph Codes. An error-correcting graph code of distance is a family of graphs on a common vertex set of size , such that if…