Key points are not available for this paper at this time.
For each of the lattices A₍ (n 1), D₍ (n 2), E₆, E₇, E₈, and their duals a very fast algorithm is given for finding the closest lattice point to an arbitrary point. If these lattices are used for vector quantizing of uniformly distributed data, the algorithm finds the minimum distortion lattice point. If the lattices are used as codes for a Gaussian channel, the algorithm performs maximum likelihood decoding.
Conway et al. (Mon,) studied this question.