Improved inapproximability of lattice and coding problems with preprocessing

Research output: Contribution to journalArticle

Abstract

We show that the closest vector problem with preprocessing (CVPP) is NP-hard to approximate to within √3-ε for any ε > 0. In addition, we show that the nearest codeword problem with preprocessing (NCPP) is NP-hard to approximate to within 3 - ε. These results improve previous results of Feige and Micciancio. We also present the first inapproximability result for the relatively nearest codeword problem with preprocessing (RNCP). Finally, we describe an n-approximation algorithm to CVPP.

Original languageEnglish (US)
Pages (from-to)2031-2037
Number of pages7
JournalIEEE Transactions on Information Theory
Volume50
Issue number9
DOIs
StatePublished - Sep 2004

Fingerprint

coding
Approximation algorithms

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Improved inapproximability of lattice and coding problems with preprocessing. / Regev, Oded.

In: IEEE Transactions on Information Theory, Vol. 50, No. 9, 09.2004, p. 2031-2037.

Research output: Contribution to journalArticle

@article{0de22afa5dd64bce90b18fbbb3f6f418,
title = "Improved inapproximability of lattice and coding problems with preprocessing",
abstract = "We show that the closest vector problem with preprocessing (CVPP) is NP-hard to approximate to within √3-ε for any ε > 0. In addition, we show that the nearest codeword problem with preprocessing (NCPP) is NP-hard to approximate to within 3 - ε. These results improve previous results of Feige and Micciancio. We also present the first inapproximability result for the relatively nearest codeword problem with preprocessing (RNCP). Finally, we describe an n-approximation algorithm to CVPP.",
author = "Oded Regev",
year = "2004",
month = "9",
doi = "10.1109/TIT.2004.833350",
language = "English (US)",
volume = "50",
pages = "2031--2037",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Improved inapproximability of lattice and coding problems with preprocessing

AU - Regev, Oded

PY - 2004/9

Y1 - 2004/9

N2 - We show that the closest vector problem with preprocessing (CVPP) is NP-hard to approximate to within √3-ε for any ε > 0. In addition, we show that the nearest codeword problem with preprocessing (NCPP) is NP-hard to approximate to within 3 - ε. These results improve previous results of Feige and Micciancio. We also present the first inapproximability result for the relatively nearest codeword problem with preprocessing (RNCP). Finally, we describe an n-approximation algorithm to CVPP.

AB - We show that the closest vector problem with preprocessing (CVPP) is NP-hard to approximate to within √3-ε for any ε > 0. In addition, we show that the nearest codeword problem with preprocessing (NCPP) is NP-hard to approximate to within 3 - ε. These results improve previous results of Feige and Micciancio. We also present the first inapproximability result for the relatively nearest codeword problem with preprocessing (RNCP). Finally, we describe an n-approximation algorithm to CVPP.

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

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

U2 - 10.1109/TIT.2004.833350

DO - 10.1109/TIT.2004.833350

M3 - Article

AN - SCOPUS:4544250860

VL - 50

SP - 2031

EP - 2037

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 9

ER -