Ron-Zewi, Noga

1. Improved decoding of Folded Reed-Solomon and Multiplicity Codes
   2018/05/03 by Kopparty, Swastik, Ron-Zewi, Noga, Saraf, Shubhangi +1 · 2 citations
   #FOS: Computer and information sciences #Information Theory (cs.IT)
2. Efficient List-Decoding with Constant Alphabet and List Sizes
   2020/11/11 by Guo, Zeyu, Ron-Zewi, Noga · 2 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Information Theory (cs.IT)
3. A new upper bound on the query complexity for testing generalized Reed-Muller codes
   2012/04/24 by Ron-Zewi, Noga, Sudan, Madhu · 1 citation
   #FOS: Computer and information sciences #Information Theory (cs.IT)
4. High rate locally-correctable and locally-testable codes with\n sub-polynomial query complexity
   2015/04/22 by Swastik Kopparty, Kopparty, Swastik, Or Meir +5 · 1 citation
   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
5. Linear-time Erasure List-decoding of Expander Codes
   2020/02/20 by Ron-Zewi, Noga, Wootters, Mary, Zémor, Gilles · 1 citation
   #FOS: Computer and information sciences #Information Theory (cs.IT)
6. Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size
   2024/01/25 by Ron-Zewi, Noga, Venkitesh, S., Wootters, Mary · 1 citation
   #FOS: Computer and information sciences #Information Theory (cs.IT)