By Topic

Linear-Time Nearest Point Algorithms for Coxeter Lattices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
McKilliam, R.G. ; Sch. of Inf. Technol. & Electr. Eng., Univ. of Queensland, Brisbane, QLD, Australia ; Smith, W.D. ; Clarkson, I.V.L.

The Coxeter lattices are a family of lattices containing many of the important lattices in low dimensions. This includes An, E 7 , E 8 and their duals An*, E 7*, and E 8*. We consider the problem of finding a nearest point in a Coxeter lattice. We describe two new algorithms, one with worst case arithmetic complexity O(nlogn) and the other with worst case complexity O(n) where n is the dimension of the lattice. We show that for the particular lattices An and An* the algorithms are equivalent to nearest point algorithms that already exist in the literature.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 3 )