Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
New Set of Codes for the Maximum-Likelihood Decoding Problem M. Barbier Abstract The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduc
Add to Reading List
Document Date: 2012-09-14 10:31:23
Open Document
File Size: 76,87 KB
Share Result on Facebook
New Set of Codes for the Maximum-Likelihood Decoding Problem M. Barbier Abstract The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduc