2 search results - page 1 / 1 » Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard |
100
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
96
Voted
CORR
2010
Springer
15 years 12 days ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...