码间隔最小距离问题的一种简单确定性约简
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
摘要:
我们提出了一个简单的确定性的间隙保持减少从SAT的最小距离的代码问题在$\F_2$。我们还展示了如何扩大减少工作在任何有限域。以前,由于Dumer,Micciancio和Sudan,已知随机减少,最近被Cheng和Wan去随机化。这些减少依赖于高度非平凡的编码理论的建设,而我们的减少是基本的。作为一个额外的功能,我们的减少给出了一个常数因子硬度,即使是渐近良好的代码,即,具有恒定的速率和相对距离。以前,它是不知道如何实现确定性减少这样的代码。
英文摘要:
We present a simple deterministic gap-preserving reduction from SAT to the Minimum Distance of Code Problem over $\F_2$. We also show how to extend the reduction to work over any 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 on highly non-trivial coding theoretic constructions whereas our reduction is elementary. As an additional feature, our reduction gives a constant factor hardness even for asymptotically good codes, i.e., having constant rate and relative distance. Previously it was not known how to achieve deterministic reductions for such codes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。