Sciweavers

CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 20 days ago
New Set of Codes for the Maximum-Likelihood Decoding Problem
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...
Morgan Barbier