Well-rounded lattices via polynomials with real roots

dc.contributor	Universidade Estadual Paulista (UNESP)
dc.date.accessioned	2022-04-28T19:29:20Z
dc.date.accessioned	2022-12-20T01:12:57Z
dc.date.available	2022-04-28T19:29:20Z
dc.date.available	2022-12-20T01:12:57Z
dc.date.created	2022-04-28T19:29:20Z
dc.date.issued	2020-01-01
dc.identifier	International Journal of Applied Mathematics, v. 33, n. 4, p. 663-672, 2020.
dc.identifier	1314-8060
dc.identifier	1311-1728
dc.identifier	http://hdl.handle.net/11449/221552
dc.identifier	10.12732/ijam.v33i4.10
dc.identifier	2-s2.0-85090829819
dc.identifier.uri	https://repositorioslatinoamericanos.uchile.cl/handle/2250/5401681
dc.description.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 the well-roundedness of lattices coming from polynomials with integer coefficients and real roots.
dc.language	eng
dc.relation	International Journal of Applied Mathematics
dc.source	Scopus
dc.subject	Dense packing
dc.subject	Minimum norm
dc.subject	Polynomials
dc.subject	Well-rounded lattice
dc.title	Well-rounded lattices via polynomials with real roots
dc.type	Artículos de revistas