Upper bound for the coefficients of the shortest vector of random lattice

Abstract

This paper shows that upper bounds on the coefficients of the shortest vector of a lattice can be represented using the smallest eigenvalue of the Gram matrix for the lattice, obtains its distribution for high-dimensional random Goldstein-Mayer lattice, and applies it to determine the percentage of zeros of coefficient vector.