4.5 Article

Dense Packings via Lifts of Codes to Division Rings

Journal

IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 69, Issue 5, Pages 2860-2873

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2022.3226028

Keywords

Lattices; Algebra; Codes; Encoding; Quaternions; Manganese; Complexity theory; sphere packings; random codes; codes over matrix rings; division rings

Ask authors/readers for more resources

This article obtains algorithmically effective versions of dense lattice sphere packings constructed from orders in Q-division rings. The lattices discussed are lifts of suitable codes from prime characteristic to orders O in Q-division rings, and a Minkowski-Hlawka type result for such lifts is proven. By exploiting the additional symmetries under finite subgroups of units in O, effective constructions of lattices approaching the best known lower bounds on the packing density ?(n) in various new dimensions n are achieved. This unifies and extends previous constructions.
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 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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available