On the inherent intractability of certain coding problems (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.3, pp.384-386, 1978. ,
DOI : 10.1109/TIT.1978.1055873
Covering codes, 1997. ,
List Decoding of Error-Correcting Codes: Winning Thesis of the, ACM Doctoral Dissertation Competition. Lecture Notes in Computer Science, vol.3282, 2002. ,
DOI : 10.1007/b104335
Maximum-Likelihood Decoding of Reed???Solomon Codes is NP-Hard, SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp.470-478, 2005. ,
DOI : 10.1109/TIT.2005.850102
The Theory of Error-Correcting Codes. North-Holland Mathematical Library, 1988. ,
The Guruswami-Sudan decoding algorithm for Reed-Solomon codes The Interplanetary Network Progress Report 42-153, pp.42-153, 2003. ,
The complexity of computing the covering radius of a code Information Theory, IEEE Transactions on, vol.30, issue.6, pp.800-804, 1984. ,
New List Decoding Algorithms for Reed–Solomon and BCH Codes, IEEE Transactions on Information Theory, vol.54, issue.8, pp.3611-3630, 2008. ,
DOI : 10.1109/TIT.2008.926355