A simple deterministic reduction for the gap minimum distance of code problem

Per Austrin, Subhash Khot

Research output: Contribution to journalArticle

Abstract

We present a simple deterministic gap-preserving reduction from SAT to the minimum distance of code problem over F{double-struck}2. We also show how to extend the reduction to work over any fixed finite field. Previously, a randomized reduction was known due to Dumer, Micciancio, and Sudan, which was recently derandomized by Cheng and Wan. These reductions rely on highly nontrivial coding theoretic constructions, whereas our reduction is elementary. As an additional feature, our reduction gives hardness within a constant factor even for asymptotically good codes, i.e., having constant positive rate and relative distance. Previously, it was not known how to achieve a deterministic reduction for such codes.

Original languageEnglish (US)
Article number6868217
Pages (from-to)6636-6645
Number of pages10
JournalIEEE Transactions on Information Theory
Volume60
Issue number10
DOIs
StatePublished - Oct 1 2014

Fingerprint

Sudan
strike
coding
Hardness

Keywords

  • computational complexity
  • Linear code

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

A simple deterministic reduction for the gap minimum distance of code problem. / Austrin, Per; Khot, Subhash.

In: IEEE Transactions on Information Theory, Vol. 60, No. 10, 6868217, 01.10.2014, p. 6636-6645.

Research output: Contribution to journalArticle

@article{cf6075220df7499499d8d9a3e6e66b01,
title = "A simple deterministic reduction for the gap minimum distance of code problem",
abstract = "We present a simple deterministic gap-preserving reduction from SAT to the minimum distance of code problem over F{double-struck}2. We also show how to extend the reduction to work over any fixed finite field. Previously, a randomized reduction was known due to Dumer, Micciancio, and Sudan, which was recently derandomized by Cheng and Wan. These reductions rely on highly nontrivial coding theoretic constructions, whereas our reduction is elementary. As an additional feature, our reduction gives hardness within a constant factor even for asymptotically good codes, i.e., having constant positive rate and relative distance. Previously, it was not known how to achieve a deterministic reduction for such codes.",
keywords = "computational complexity, Linear code",
author = "Per Austrin and Subhash Khot",
year = "2014",
month = "10",
day = "1",
doi = "10.1109/TIT.2014.2340869",
language = "English (US)",
volume = "60",
pages = "6636--6645",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - A simple deterministic reduction for the gap minimum distance of code problem

AU - Austrin, Per

AU - Khot, Subhash

PY - 2014/10/1

Y1 - 2014/10/1

N2 - We present a simple deterministic gap-preserving reduction from SAT to the minimum distance of code problem over F{double-struck}2. We also show how to extend the reduction to work over any fixed finite field. Previously, a randomized reduction was known due to Dumer, Micciancio, and Sudan, which was recently derandomized by Cheng and Wan. These reductions rely on highly nontrivial coding theoretic constructions, whereas our reduction is elementary. As an additional feature, our reduction gives hardness within a constant factor even for asymptotically good codes, i.e., having constant positive rate and relative distance. Previously, it was not known how to achieve a deterministic reduction for such codes.

AB - We present a simple deterministic gap-preserving reduction from SAT to the minimum distance of code problem over F{double-struck}2. We also show how to extend the reduction to work over any fixed finite field. Previously, a randomized reduction was known due to Dumer, Micciancio, and Sudan, which was recently derandomized by Cheng and Wan. These reductions rely on highly nontrivial coding theoretic constructions, whereas our reduction is elementary. As an additional feature, our reduction gives hardness within a constant factor even for asymptotically good codes, i.e., having constant positive rate and relative distance. Previously, it was not known how to achieve a deterministic reduction for such codes.

KW - computational complexity

KW - Linear code

UR - http://www.scopus.com/inward/record.url?scp=84907221430&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84907221430&partnerID=8YFLogxK

U2 - 10.1109/TIT.2014.2340869

DO - 10.1109/TIT.2014.2340869

M3 - Article

AN - SCOPUS:84907221430

VL - 60

SP - 6636

EP - 6645

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 10

M1 - 6868217

ER -