Constructing integral lattices with prescribed minimum. I
Wilhelm Plesken, Michael E. Pohst · Mathematics of Computation · 1985
Methods for computing integral laminated lattices with prescribed minimum are developed. Laminating is a process of stacking layers of an ( n − 1 ) (n - 1) -dimensional lattice as densely as possible to obtain an n -dimensional lattice. Our side conditions are: All scalar products of lattice vectors are rational integers, and all lattices are generated by vectors of prescribed minimum (square) length m . For m = 3 m = 3 all such lattices are determined.