Lattice (List) Decoding Near Minkowski's Inequality

10/09/2020
by   Ethan Mook, et al.
0

Minkowski proved that any n-dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most √(n); in fact, there are 2^Ω(n) such lattice vectors. Lattices whose minimum distances come close to Minkowski's bound provide excellent sphere packings and error-correcting codes in ℝ^n. The focus of this work is a certain family of efficiently constructible n-dimensional lattices due to Barnes and Sloane, whose minimum distances are within an O(√(log n)) factor of Minkowski's bound. Our primary contribution is a polynomial-time algorithm that list decodes this family to distances approaching 1/√(2) times the minimum distance. The main technique is to decode Reed-Solomon codes under error measured in the Euclidean norm, using the Koetter-Vardy "soft decision" variant of the Guruswami-Sudan list-decoding algorithm.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/11/2020

Unique Decoding of Explicit ε-balanced Codes Near the Gilbert-Varshamov Bound

The Gilbert-Varshamov bound (non-constructively) establishes the existen...
05/04/2020

On the list recoverability of randomly punctured codes

We show that a random puncturing of a code with good distance is list re...
03/17/2020

Hardness of Bounded Distance Decoding on Lattices in ℓ_p Norms

Bounded Distance Decoding _p,α is the problem of decoding a lattice when...
03/12/2021

On the list decodability of rank-metric codes containing Gabidulin codes

Wachter-Zeh in [42], and later together with Raviv [31], proved that Gab...
02/15/2022

Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes

We give a simple proof that the (approximate, decisional) Shortest Vecto...
07/19/2020

A 2^n/2-Time Algorithm for √(n)-SVP and √(n)-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP

We show a 2^n/2+o(n)-time algorithm that finds a (non-zero) vector in a ...
04/10/2019

On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields

In this paper, we continue our previous work on the reduction of algebra...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.