 
Summary: Deterministic Approximation Algorithms for the
Nearest Codeword Problem
Noga Alon1,
, Rina Panigrahy2
, and Sergey Yekhanin3
1
Tel Aviv University, Institute for Advanced Study, Microsoft Israel
nogaa@tau.ac.il
2
Microsoft Research Silicon Valley
rina@microsoft.com
3
Microsoft Research Silicon Valley
yekhanin@microsoft.com
Abstract. The Nearest Codeword Problem (NCP) is a basic algorithmic
question in the theory of errorcorrecting codes. Given a point v Fn
2
and a linear space L Fn
2 of dimension k NCP asks to find a point
l L that minimizes the (Hamming) distance from v. It is wellknown
