Finding the Closest Lattice Point

  • J. H. Conway
  • N. J. A. Sloane
Part of the Grundlehren der mathematischen Wissenschaften book series (GL, volume 290)

Abstract

This chapter describes algorithms which, given an arbitrary point of R n , find the closest point of some given lattice. The lattices discussed include the root lattices A n , D n ,E 6, E 7, E 8 and their duals. These algorithms can be used for vector quantizing or for decoding lattice codes for a bandlimited channel.

Keywords

Arbitrary Point Close Point Binary Code Decode Algorithm Coset Representative 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1988

Authors and Affiliations

  • J. H. Conway
  • N. J. A. Sloane

There are no affiliations available

Personalised recommendations