7 citations · 9 across the 8 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.IT2016
NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott Problem
Venkata Gandikota, Badih Ghazi, Elena Grigorescu
Establishing the complexity of {\em Bounded Distance Decoding} for Reed-Solomon codes is a fundamental open problem in coding theory, explicitly asked by Guruswami and Vardy (IEEE…
cs.DS2016★ 1 cited
Local Testing for Membership in Lattices
Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota +1
Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study o…