A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
From MaRDI portal
Publication:5892608
DOI10.1007/978-3-642-22006-7_40zbMath1334.68082arXiv1010.1481MaRDI QIDQ5892608
Publication date: 6 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.1481
94B05: Linear codes (general theory)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
- The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
- Pseudorandom Bits for Polynomials
- Proof verification and the hardness of approximation problems
- Complexity of Decoding Positive-Rate Reed-Solomon Codes
- Probabilistic checking of proofs
- Interactive proofs and the hardness of approximating cliques
- The intractability of computing the minimum distance of a code
- Hardness of approximating the minimum distance of a linear code
- A deterministic reduction for the gap minimum distance problem
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem