WELL-ROUNDED LATTICES
VIA POLYNOMIALS WITH REAL ROOTS
Carina Alves1, William L.S. Pinto2,
Antonio A. Andrade3
1,2 Department of Mathematics
São Paulo State University
Rio Claro - SP, 13506-900, BRAZIL
3 Department of Mathematics
São Paulo State University
São José do Rio Preto-SP, 15054-000, BRAZIL

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.

Citation details of the article



Journal: International Journal of Applied Mathematics
Journal ISSN (Print): ISSN 1311-1728
Journal ISSN (Electronic): ISSN 1314-8060
Volume: 33
Issue: 4
Year: 2020

DOI: 10.12732/ijam.v33i4.10

Download Section



Download the full text of article from here.

You will need Adobe Acrobat reader. For more information and free download of the reader, please follow this link.

References

  1. [1] A.A. Andrade and J.C. Interlando, Construction of even-dimensional lattices of full diversity, International Journal of Applied Mathematics, 32, No 2 (2019), 325-332; doi: 10.12732/ijam.v32i2.12.
  2. [2] J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices and Groups, Springer-Verlag (1999).
  3. [3] A.L. Flores, J.C. Interlando and T.P. N´obrega Neto, Optimal families of two and three-dimensional lattice packings from polynomials with integer coefficients, JP J. of Algebra, Number Theory and Applications, 15, No 1 (2009), 45-51.
  4. [4] L. Fukshansky and K. Petersen, On well-rounded ideal lattices, J. of Number Theory, 8, No 1 (2012), 189-206.
  5. [5] L. Fukshansky and X. Sun, On the geometry of cyclic lattices, Discrete & Computational Geometry, 52 (2014), 240-259. WELL-ROUNDED LATTICES... 673
  6. [6] O.W. Gnilke, A. Barreal, A. Karrila, H.T.N. Tran, D.A. Karpuk and C. Hollanti, Well-rounded lattices for coset coding in MIMO wiretap channels, In: Intern. Telecommunication Networks and Applications Conference (2016), 289-294.
  7. [7] O.W. Gnilke, H.T.N. Tran, A. Karrila and C. Hollanti, Well-rounded lattices for reliability and security in Rayleigh fading SISO channels, In: IEEE Information Theory Workshop (2016), 359-363.
  8. [8] D. Micciancio, Generalized compact knapsacks, cyclic lattices and efficient one-way functions from worst-case complexity assumptions, In: FOCS, IEEE Computer Society (2002), 356-365.
  9. [9] C.C. Trinca Watanabe, J.-C. Belfiore, E.D. De Carvalho, J. Vieira Filho and R.A. Watanabe, Construction of nested real ideal lattices for interference channel coding, International Journal of Applied Mathematics, 32, No 2 (2019), 295-323; doi: 10.12732/ijam.v32i2.11.