Journal Article
Explicit Capacity-achieving Codes for Worst-Case Additive Errors
Explicit Capacity-achieving Codes for Worst-Case Additive Errors
Almost euclidean subspaces of Ell; N 1 via expander codes
Concatenated codes can achieve list-decoding capacity
Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy