An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
| dc.creator | McKilliam, Robby G. | |
| dc.creator | Clarkson, I. Vaughan L. | |
| dc.creator | Quinn, Barry G. | |
| dc.date | 2008-01-09 | |
| dc.date | 2008-09-30 | |
| dc.date.accessioned | 2026-07-07T10:05:54Z | |
| dc.date.available | 2026-07-07T10:05:54Z | |
| dc.description | The lattice $A_n^*$ 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 $A_n^*$ that requires $O(n\log{n})$ arithmetic operations. In this paper, we describe a new algorithm. While the complexity is still $O(n\log{n})$, it is significantly simpler to describe and verify. In practice, we find that the new algorithm also runs faster. | |
| dc.description | 3 pages | |
| dc.identifier | https://arxiv.org/abs/0801.1364 | |
| dc.identifier | http://arxiv.org/abs/0801.1364 | |
| dc.identifier | IEEE Transactions on Information Theory, Vol. 54, No. 9, pp 4378-4381, Sept. 2008 | |
| dc.identifier | doi:10.1109/TIT.2008.928280 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/170150 | |
| dc.subject | Information Theory | |
| dc.title | An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$ | |
| dc.type | text |