Well-Rounded Lattices via Polynomials
classification
💻 cs.IT
math.IT
keywords
well-roundedlatticespolynomialsspaceapplicationsbeencalledchannels
read the original abstract
Well-rounded lattices have been a topic of recent studies with applications in wiretap channels and in cryptography. A lattice of full rank in Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. In this paper, we investigate when lattices coming from polynomials with integer coefficients are well-rounded.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.