A Deterministic Reduction for the Gap Minimum Distance Problem
From MaRDI portal
Publication:2989711
DOI10.1109/TIT.2012.2209198zbMath1364.94593OpenAlexW2078536889MaRDI QIDQ2989711
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2012.2209198
Related Items (8)
Solving linear equations parameterized by Hamming weight ⋮ Subset sums over Galois rings. II ⋮ On closest pair in Euclidean metric: monochromatic is as hard as bichromatic ⋮ Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH ⋮ Counting polynomials with distinct zeros in finite fields ⋮ Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_p\) norms ⋮ On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic ⋮ Subset sums over Galois rings
This page was built for publication: A Deterministic Reduction for the Gap Minimum Distance Problem
