activity
20092026
most citedComplexity of Inference in Graphical Models

85 citations · 294 across the 35 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2025

Fast list recovery of univariate multiplicity and folded Reed-Solomon codes

Rohan Goyal, Prahladh Harsha, Mrinal Kumar +1

A recent work of Goyal, Harsha, Kumar and Shankar gave nearly linear time algorithms for the list decoding of Folded Reed-Solomon codes (FRS) and univariate multiplicity codes up t…

cs.IT2023

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes

Rohan Goyal, Prahladh Harsha, Mrinal Kumar +1

We show that the known list-decoding algorithms for univariate multiplicity and folded Reed-Solomon codes can be made to run in time. Univariate multiplicity codes a…

cs.IT2022

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…

cs.IT2021

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…

cs.IT2020★ 3 cited

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…