Well-Rounded Lattices via Polynomials
Information Theory
2019-04-09 v1 math.IT
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.
Cite
@article{arxiv.1904.03510,
title = {Well-Rounded Lattices via Polynomials},
author = {Carina Alves and William Lima da Silva Pinto and Antonio Aparecido de Andrade},
journal= {arXiv preprint arXiv:1904.03510},
year = {2019}
}