Abstract

We obtain 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 <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i> 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 <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i> , we show that this leads to effective constructions of lattices approaching the best known lower bounds on the packing density Δ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><i>n</i></sub> in a variety of new dimensions <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> . This unifies and extends a number of previous constructions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.