@article{a35aaae20733433db6530bf042e62899,

title = "An algorithm to compute the nearest point in the lattice An * ",

abstract = "The lattice An* is an important lattice because of its covering properties in low dimensions. Clarkson described an algorithm to compute the nearest lattice point in An * 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.",

author = "McKilliam, {Robby G.} and Clarkson, {I. Vaughan L} and Quinn, {Barry G.}",

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{\^a}€{\texttrademark}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.",

year = "2008",

doi = "10.1109/TIT.2008.928280",

language = "English",

volume = "54",

pages = "4378--4381",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

number = "9",

}