Harry Sha

collaborators

3 papers

cs.IT2025

High Rate Multivariate Polynomial Evaluation Codes

Swastik Kopparty, Mrinal Kumar, Harry Sha

The classical Reed-Muller codes over a finite field $F_{q}$ are based on evaluations of $m$ -variate polynomials of degree at most $d$ over a product set $U^{m}$ , for some $d$ …

cs.CC2024

Small Shadow Partitions

Swastik Kopparty, Harry Sha

We study the problem of partitioning the unit cube $[0, 1]^{n}$ into $c$ parts so that each $d$ -dimensional axis-parallel projection has small volume. This natural combinatorial/geome…

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 $I^´$ is a family $C$ of graphs on a common vertex set of size $n$ , such that if…