arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0304044cs.CC
收藏

二元线性码的权计数器的逼近困难性

Hardness of approximating the weight enumerator of a binary linear code

M. N. Vyalyi

摘要:

本文研究二元线性码的权计数器的计算问题。我们表明,精确的评估是很难的多项式层次。更确切地说,如果WE是回答评估问题的解决方案的预言机,则P^WE=P^GapP。此外,我们还考虑了权重计数器的近似估计。在具有附加精度$2^{αn}$的近似的情况下,$α$是常数,在上述意义上问题是困难的。我们还证明,对于$0<\al<\al_0\approx0.88$来说,单点$e^{πi/4}$的近似评估是困难的。

英文摘要:

We consider the problem of evaluation of the weight enumerator of a binary linear code. We show that the exact evaluation is hard for polynomial hierarchy. More exactly, if WE is an oracle answering the solution of the evaluation problem then P^WE=P^GapP. Also we consider the approximative evaluation of the weight enumerator. In the case of approximation with additive accuracy $2^{αn}$, $α$ is constant the problem is hard in the above sense. We also prove that approximate evaluation at a single point $e^{πi/4}$ is hard for $0<\al<\al_0\approx0.88$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑