Nearest Codeword Problem

10

FOCS
2005
IEEE

106views Theoretical Computer Science» more FOCS 2005»

Hardness of Approximating the Closest Vector Problem with Pre-Processing

13 years 10 months ago

d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...

Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Ni...

claim paper

Read More »

13

click to vote

APPROX
2009
Springer

112views Algorithms» more APPROX 2009»

Deterministic Approximation Algorithms for the Nearest Codeword Problem

13 years 11 months ago

Download research.microsoft.com

The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...

Noga Alon, Rina Panigrahy, Sergey Yekhanin

claim paper

Read More »

15

click to vote

STOC
2009
ACM

172views Algorithms» more STOC 2009»

Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems

14 years 5 months ago

Download www.cs.brown.edu

We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...

Marek Karpinski, Warren Schudy

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers