An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
Information Theory
2008-09-30 v2 math.IT
Abstract
The lattice is an important lattice because of its covering properties in low dimensions. Clarkson \cite{Clarkson1999:Anstar} described an algorithm to compute the nearest lattice point in that requires arithmetic operations. In this paper, we describe a new algorithm. While the complexity is still , it is significantly simpler to describe and verify. In practice, we find that the new algorithm also runs faster.
Cite
@article{arxiv.0801.1364,
title = {An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$},
author = {Robby G. McKilliam and I. Vaughan L. Clarkson and Barry G. Quinn},
journal= {arXiv preprint arXiv:0801.1364},
year = {2008}
}
Comments
3 pages