Search
Now showing items 1-1 of 1
SETH-Hardness of Coding Problems
(Institute of Electrical and Electronics Engineers (IEEE), 2020-01)
We show that assuming the strong exponential-Time hypothesis (SETH), there are no non-Trivial algorithms for the nearest codeword problem (NCP), the minimum distance problem (MDP), or the nearest codeword problem with ...