Finding the Closest Lattice Point by Iterative Slicing

DOI10.1137/060676362zbMath1193.94010OpenAlexW1996271812MaRDI QIDQ3563937

Ofir Shalvi, Naftali Sommer, Meir Feder

Publication date: 1 June 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060676362

zbMATH Keywords

latticelattice codeslattice quantizationlattice decodingclosest neighborclosest point searchVoronoi relevant vectors

Mathematics Subject Classification ID

Other types of codes (94B60) Communication theory (94A05)

Related Items (7)

Sieve, Enumerate, Slice, and Lift: ⋮ Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems ⋮ The irreducible vectors of a lattice: some theory and applications ⋮ Generalizing CGAL Periodic Delaunay Triangulations ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ Approximate Voronoi cells for lattices, revisited ⋮ The randomized slicer for CVPP: sharper, faster, smaller, batchier

This page was built for publication: Finding the Closest Lattice Point by Iterative Slicing