Brett Hemenway,et al. Local List Recovery of High-Rate Tensor Codes and Applications , 2020, SIAM J. Comput..
 Venkatesan Guruswami,et al. Linear-Time List Decoding in Error-Free Settings: (Extended Abstract) , 2004, ICALP.
 Venkatesan Guruswami,et al. Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes , 2013, IEEE Transactions on Information Theory.
 Or Meir,et al. High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity , 2016, STOC.
 Brett Hemenway,et al. Local List Recovery of High-Rate Tensor Codes & Applications , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
 Venkatesan Guruswami,et al. List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound , 2013, STOC '13.
 Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2008, IEEE Transactions on Information Theory.
 Venkatesan Guruswami,et al. Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets , 2002, STOC '02.
 Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
 Brett Hemenway,et al. Linear-time list recovery of high-rate expander codes , 2018, Inf. Comput..
 Eyal Kushilevitz,et al. Learning decision trees using the Fourier spectrum , 1991, STOC '91.
 Venkatesan Guruswami. List Decoding of Error-Correcting Codes (Winning Thesis of the 2002 ACM Doctoral Dissertation Competition) , 2004, Lecture Notes in Computer Science.
 Noga Alon,et al. Linear time erasure codes with nearly optimal recovery , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
 Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
 Shubhangi Saraf,et al. Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound , 2016, Electron. Colloquium Comput. Complex..
 Alexander Vardy,et al. Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
 Shubhangi Saraf,et al. Noisy Interpolation of Sparse Polynomials, and Applications , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
 Or Meir,et al. High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity , 2017, J. ACM.
 Atri Rudra,et al. Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion , 2012, STACS.
 Venkatesan Guruswami,et al. Folded codes from function field towers and improved optimal rate list decoding , 2012, STOC '12.
 Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
 Madhu Sudan. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
 Atri Rudra,et al. Average-radius list-recoverability of random linear codes , 2018, SODA.
 Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..