### Abstract

The lattice A^{n}* is an important lattice because of its covering properties in low dimensions. Clarkson described an algorithm to compute the nearest lattice point in A_{n} ^{*} that requires O(n log n) arithmetic operations. In this correspondence, 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.

Original language | English |
---|---|

Pages (from-to) | 4378-4381 |

Number of pages | 4 |

Journal | IEEE Transactions on Information Theory |

Volume | 54 |

Issue number | 9 |

DOIs | |

Publication status | Published - 2008 |

### Bibliographical note

Copyright [2008] IEEE. Reprinted from [IEEE transactions on information theory, 54:9, 4378-4381]. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie Universityâ€™s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.## Cite this

McKilliam, R. G., Clarkson, I. V. L., & Quinn, B. G. (2008). An algorithm to compute the nearest point in the lattice A

_{n}^{*}*IEEE Transactions on Information Theory*,*54*(9), 4378-4381. https://doi.org/10.1109/TIT.2008.928280