4 papers
Deterministic list decoding of Reed-Solomon codes
Soham Chatterjee, Prahladh Harsha, Mrinal Kumar
We show that Reed-Solomon codes of dimension and block length over any finite field can be deterministically list decoded from agreement in tim…
Advances in List Decoding of Polynomial Codes
Mrinal Kumar, Noga Ron-Zewi
Error-correcting codes are a method for representing data, so that one can recover the original information even if some parts of it were corrupted. The basic idea, which dates bac…
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…