Dense Generic Well-Rounded Lattices
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.
Date
Major/Subject
Mcode
Degree programme
Language
en
Pages
32
Series
SIAM Journal on Applied Algebra and Geometry, Volume 9, issue 1, pp. 154-185
Abstract
It is well known that the densest lattice sphere packings also typically have large kissing numbers. The sphere packing density maximization problem is known to have a solution among well-rounded lattices, of which the integer lattice ℤn is the simplest example. The integer lattice is also an example of a generic well-rounded lattice, i.e., a well-rounded lattice with a minimal kissing number. However, the integer lattice has the worst density among well-rounded lattices. In this paper, the problem of constructing explicit generic well-rounded lattices with dense sphere packings is considered. To this end, so-called tame lattices recently introduced by Damir and Mantilla-Soler are utilized. Tame lattices came to be as a generalization of the ring of integers of certain abelian number fields. The sublattices of tame lattices constructed in this paper are shown to always result in either a generic well-rounded lattice or the lattice An, with density ranging between that of ℤn and An. In order to find generic well-rounded lattices with densities beyond that of An, explicit deformations of some known densest lattice packings are constructed, yielding a family of generic well-rounded lattices with densities arbitrarily close to the optimum. In addition to being an interesting mathematical problem in its own right, the constructions are also motivated from a more practical point of view. Namely, generic well-rounded lattices with high packing density make good candidates for lattice codes used in secure wireless communications.Description
Publisher Copyright: © 2025 Society for Industrial and Applied Mathematics.
Other note
Citation
Hollanti, C, Mantilla-Soler, G & Miller, N 2025, 'Dense Generic Well-Rounded Lattices', SIAM Journal on Applied Algebra and Geometry, vol. 9, no. 1, pp. 154-185. https://doi.org/10.1137/22M1532779