Noga Ron-Zewi

1. High rate locally-correctable and locally-testable codes with sub-polynomial query complexity
   2015/04/22 by Swastik Kopparty, Or Meir, Kopparty, Swastik +6 · 3 citations
   Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced Data Storage Technologies #Computational Complexity (cs.CC) #Cryptography and Data Security #DNA and Biological Computing #FOS: Computer and information sciences #cs.CC
2. Improved decoding of Folded Reed-Solomon and Multiplicity Codes
   2018/05/03 by Swastik Kopparty, Kopparty, Swastik, Noga Ron-Zewi +5 · 3 citations
   Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
3. A new upper bound on the query complexity for testing generalized Reed-Muller codes
   2012/04/24 by Noga Ron-Zewi, Madhu Sudan, Ron-Zewi, Noga +1 · 1 citation
   Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
4. Local List Recovery of High-rate Tensor Codes and Applications
   2017/06/11 by Brett Hemenway, Noga Ron-Zewi, Hemenway, Brett +3 · 1 citation
   Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT