An Algorithm to Compute a Nearest Point in the Lattice An*

Authors:
I. Vaughan;L. Clarkson
Affiliations:
-;-
Venue:
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
1999

Citing 2
Cited 1

Soft decoding techniques for codes and Lattices, including the Golay code and the Leech Lattice

IEEE Transactions on Information Theory
Sphere-packings, lattices, and groups

Sphere-packings, lattices, and groups

Linear-time nearest point algorithms for coxeter lattices

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

The lattice An* is an important lattice because of its covering properties in low dimensions. CONWAY AND SLOANE [3] appear to have been the first to consider the problem of computing the nearest lattice point in An*. They developed and later improved [4] an algorithm which is able to compute a nearest point in O(n2) arithmetic steps. In this paper, a new algorithm is developed which is able to compute a nearest point in O(n log n) steps.