Abstract
A lattice is a discrete additive subgroup of R^n. It can be shown that given a lattice Lambda em R^n, there are m linearly independent vectors over R so that Lambda can be described as a linear combination of these m vectors with integer coefficients. A full rank lattice, that is, when m=n, is said to be well-rounded if the set consisting of its minimum Euclidean norm vectors generates R^…