Closest point search in lattices
From MaRDI portal
Publication:4677541
DOI10.1109/TIT.2002.800499zbMATH Open1062.94035OpenAlexW2140940105WikidataQ57567982 ScholiaQ57567982MaRDI QIDQ4677541FDOQ4677541
Authors: Erik Agrell, Thomas Eriksson, Alexander Vardy, Kenneth Zeger 
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2002.800499
Recommendations
Cited In (44)
- Improvements in closest point search based on dual HKZ-bases
- A Digital Signature Scheme Based on CVP ∞
- A fast encoding method for lattice codes and quantizers
- A pivoted LLL algorithm
- PROMP: a sparse recovery approach to lattice-valued signals
- Efficient algorithms for discrete lattice calculations
- Rigorous and Efficient Short Lattice Vectors Enumeration
- MLAMBDA: a modified LAMBDA method for integer least-squares estimation
- A numerical method for solving quadratic integer programming problem
- Title not available (Why is that?)
- Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions
- Loop-reduction LLL algorithm and architecture for lattice-reduction-aided MIMO detection
- Dynamic trading under integer constraints
- Sieving for closest lattice vectors (with preprocessing)
- Integer matrix approximation and data mining
- The diagonal reduction algorithm using fast Givens
- Random sampling revisited: lattice enumeration with discrete pruning
- Low-complexity receivers for multiuser detection with an unknown number of active users
- A sharper lower bound on Rankin's constant
- An ADMM based method for underdetermined box-constrained integer least squares problems
- A semidefinite programming method for integer convex quadratic minimization
- Sieve algorithms for the shortest vector problem are practical
- Nearest lattice point algorithms on semi \(k\)-reduced basis
- Finding the closest lattice point by iterative slicing
- Algorithms for the shortest and closest lattice vector problems
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- Compressed sensing for finite-valued signals
- Parallel Cholesky-based reduction for the weighted integer least squares problem
- Proximate point searching
- Euclidean distances and least squares problems for a given set of vectors
- Voronoi cells of lattices with respect to arbitrary norms
- The shortest vector problem and tame kernels of cyclotomic fields
- A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals
- The Optimal Lattice Quantizer in Nine Dimensions
- Proximal distance algorithms: theory and practice
- Selected applications of LLL in number theory
- A non-commutative cryptosystem based on quaternion algebras
- Sharper bounds on four lattice constants
- Finding well approximating lattices for a finite set of points
- A fast algorithm for determining the distances of the points of a given set in an integral lattice from its complement
- Dense periodic packings of tetrahedra with small repeating units
- Finding a closest point in a lattice of Voronoi's first kind
- The irreducible vectors of a lattice: some theory and applications
- An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
This page was built for publication: Closest point search in lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677541)
