## Closest Point Search in Lattices (2000)

### Cached

### Download Links

- [www.code.ucsd.edu]
- [www.code.ucsd.edu]
- [www.code.ucsd.edu]
- [code.ucsd.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE TRANS. INFORM. THEORY |

Citations: | 194 - 1 self |

### BibTeX

@ARTICLE{Agrell00closestpoint,

author = {Erik Agrell and Thomas Eriksson and Alexander Vardy and Kenneth Zeger},

title = {Closest Point Search in Lattices},

journal = {IEEE TRANS. INFORM. THEORY},

year = {2000},

volume = {48},

pages = {2201--2214}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this semi-tutorial paper, a comprehensive survey of closest-point search methods for lattices without a regular structure is presented. The existing search strategies are described in a unified framework, and differences between them are elucidated. An efficient closest-point search algorithm, based on the Schnorr-Euchner variation of the Pohst method, is implemented. Given an arbitrary point x 2 R m and a generator matrix for a lattice , the algorithm computes the point of that is closest to x. The algorithm is shown to be substantially faster than other known methods, by means of a theoretical comparison with the Kannan algorithm and an experimental comparison with the Pohst algorithm and its variants, such as the recent Viterbo-Boutros decoder. The improvement increases with the dimension of the lattice. Modifications of the algorithm are developed to solve a number of related search problems for lattices, such as finding a shortest vector, determining the kissing number, compu...