Venkatesan Guruswami, Alexander Vardy. Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005. pages 470-478, SIAM, 2005. [doi]
Abstract is missing.