33 citations · 36 across the 5 of their papers we have counts for
8 papers
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi +1
We study the following natural question on random sets of points in : Given a random set of points , what i…
Algorithmizing the Multiplicity Schwartz-Zippel Lemma
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar +1
The multiplicity Schwartz-Zippel lemma asserts that over a field, a low-degree polynomial cannot vanish with high multiplicity very often on a sufficiently large product set. Since…
Ideal-theoretic Explanation of Capacity-achieving Decoding
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar +1
In this work, we present an abstract framework for some algebraic error-correcting codes with the aim of capturing codes that are list-decodable to capacity, along with their decod…
Decoding Multivariate Multiplicity Codes on Product Sets
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar +1
The multiplicity Schwartz-Zippel lemma bounds the total multiplicity of zeroes of a multivariate polynomial on a product set. This lemma motivates the multiplicity codes of Koppart…
City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic
Shubhada Agrawal, Siddharth Bhandari, Anirban Bhattacharjee +14
We highlight the usefulness of city-scale agent-based simulators in studying various non-pharmaceutical interventions to manage an evolving pandemic. We ground our studies in the c…
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet
Siddharth Bhandari, Prahladh Harsha
Recently, Cohen, Haeupler and Schulman gave an explicit construction of binary tree codes over polylogarithmic-sized output alphabet based on Pudlák's construction of maximum-dista…