Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard

Venkatesan Guruswami Alexander Vardy Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard http://arxiv.org/abs/cs.CC/0405005 2004 CoRR cs.CC/0405005 db/journals/corr/corr0405.html#cs-CC-0405005 informal publication