A generalization of the LLL-algorithm over euclidean rings or orders
Numerous important lattices (, the Coxeter-Todd lattice , the Barnes-Wall lattice , the Leech lattice , as well as the -modular -dimensional lattices found by Quebbemann and Bachoc) possess algebraic structures over various Euclidean rings, e.g. Eisenstein integers or Hurwitz quaternions. One obtains efficient algorithms by performing within this frame the usual reduction procedures, including the well known LLL-algorithm.