Conference
Better Binary List-Decodable Codes Via Multilevel Concatenation
Special issue - "Conference on computational complexity 2006" - Guest editors' foreword
Achieving list decoding capacity using folded reed-solomon codes
Iterative Decoding of Low-Density Parity Check Codes (A Survey)
List decoding in average-case complexity and pseudorandomness
Hardness of Max 3SAT with no mixed clauses
Linear-time encodable/decodable codes with near-optimal rate
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard