WOW!! ๐คฏ
Among many jaw-dropping results, this proves NP-hardness of the Closest Vector and Nearest Codeword Problems for *polynomial* approximation factors, for the first time ever, and via a totally new approach (Reed-Solomon techniques). Amazing!