Well-Rounded Lattices via Polynomials

2019/04/06 by Alves, Carina, Pinto, William Lima da Silva, de Andrade, Antonio Aparecido
#11C08 #11C20 #11H31 #15A03 #15A06 #15A15 #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1904.03510

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.

Related

• Well-rounded sublattices and coincidence site lattices
• Well-Rounded Twists of Ideal Lattices from Real Quadratic Fields
• Dense generic well-rounded lattices
• A complete classification of well-rounded real quadratic ideal lattices
• On lattices generated by algebraic conjugates of prime degree