5 papers
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…
An exposition of recent list-size bounds of FRS Codes
Abhibhav Garg, Prahladh Harsha, Mrinal Kumar +2
In the last year, there have been some remarkable improvements in the combinatorial list-size bounds of Folded Reed Solomon codes and multiplicity codes. Starting from the work on…
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…
Criticality of formulae
Prahladh Harsha, Tulasi mohan Molli, Ashutosh Shankar
Rossman [In $\textit{Proc. $34$th Comput. Complexity Conf.}$, 2019] introduced the notion of . The criticality of a Boolean function $f : \{0,1\}^n \to \{0,1\…
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…