A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem


We present a simple deterministic gap-preserving reduction from SAT to the minimum distance of code problem over F<sub>2</sub>. We also show how to extend the reduction to work over any fixed finite field. Previously, a randomized reduction was known due to Dumer, Micciancio, and Sudan, which was recently derandomized by Cheng and Wan. These reductions rely… (More)
DOI: 10.1007/978-3-642-22006-7_40


3 Figures and Tables