A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem

DOI10.1109/TIT.2014.2340869zbMath1360.94408MaRDI QIDQ5892431

Per Austrin, Subhash A. Khot

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (3)

Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH ⋮ A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem ⋮ On succinct arguments and witness encryption from groups

This page was built for publication: A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem