Corpus ID: 204900001

# Hardness of approximating the weight enumerator of a binary linear code

@inproceedings{MNVyalyi2003HardnessOA,
title={Hardness of approximating the weight enumerator of a binary linear code},
author={M.N.Vyalyi},
year={2003}
}
• M.N.Vyalyi
• Published 2003
• Computer Science
• 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^{\alpha n}$, $\alpha$ is constant the problem is hard in the above sense. We also prove that approximate evaluation… CONTINUE READING