SETH-Hardness of Coding Problems
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 preprocessing (NCPP) on linear codes over any finite field. More precisely, we sho...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2021-03-03T15:15:20Z.
|
| Subjects: | |
| Online Access: | Get fulltext |