A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
From MaRDI portal
Recommendations
- A simple deterministic reduction for the gap minimum distance of code problem
- A Deterministic Reduction for the Gap Minimum Distance Problem
- A deterministic reduction for the gap minimum distance problem (extended abstract)
- On the minimum distance of combinatorial codes
- Deterministic Approximation Algorithms for the Nearest Codeword Problem
- Some algorithms for computing the minimum distance of evaluation codes
- Bounds on the Minimum Distance of Goppa Codes
- The intractability of computing the minimum distance of a code
- The new minimum distance bounds of Goppa codes and their decoding
- The minimum distance of graph codes
Cited in
(9)- On succinct arguments and witness encryption from groups
- A Deterministic Reduction for the Gap Minimum Distance Problem
- Minimum distance computation of linear codes via genetic algorithms with permutation encoding
- Parameterized intractability of even set and shortest vector problem from Gap-ETH
- A simple deterministic reduction for the gap minimum distance of code problem
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all _p norms
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms
- Improved lower bounds for approximating parameterized nearest codeword and related problems under ETH
- Approximating the number of relevant variables in a parity implies proper learning
This page was built for publication: A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892431)
