13 citations · 53 across the 21 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2018
Improved decoding of Folded Reed-Solomon and Multiplicity Codes
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf +1
In this work, we show new and improved error-correcting properties of folded Reed-Solomon codes and multiplicity codes. Both of these families of codes are based on polynomials ove…
cs.IT2016★ 1 cited
Maximally Recoverable Codes for Grid-like Topologies
Parikshit Gopalan, Guangda Hu, Swastik Kopparty +3
The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in…