Closest point search in lattices

In this semitutorial 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

• Type: Journal
• Year: 2002
• Where: TIT
• Authors: Erik Agrell, Thomas Eriksson, Alexander Vardy, Kenneth Zeger
• Keywords: Algorithm, Closest Point Search, Point Search Methods, TIT 2002