Gargava, NiharSerban, Vlad2023-06-052023-06-052023-06-052023-05-0110.1109/TIT.2022.3226028https://infoscience.epfl.ch/handle/20.500.14299/197927WOS:000976117600011obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in Q-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to orders O in Q-division rings and we prove a Minkowski-Hlawka type result for such lifts. Exploiting the additional symmetries under finite subgroups of units in O, we show that this leads to effective constructions of lattices approaching the best known lower bounds on the packing density ?(n) in a variety of new dimensions n. This unifies and extends a number of previous constructions.Computer Science, Information SystemsEngineering, Electrical & ElectronicComputer ScienceEngineeringlatticesalgebracodesencodingquaternionsmanganesecomplexity theorysphere packingsrandom codescodes over matrix ringsdivision ringstransference theoremsboundsgeometrytext::journal::journal article::research article