Random Ensembles of Lattices From Generalized Reductions

DOI10.1109/TIT.2018.2803839MaRDI QIDQ4682832zbMATH OpenOpenAlexFDO

Authors Antonio Campello

Publication date 19 September 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1702.00608

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Abstract: We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e., with packing density comparable to the Minkowski-Hlawka lower bound). Specializing to number field lattices, we obtain a number of interesting corollaries - for instance, the best known packing density of ideal lattices, and an elementary coding-theoretic construction of asymptotically dense Hurwitz lattices. All results are algorithmically effective, in the sense that, for any dimension, a finite family containing dense lattices is exhibited. For suitable constructions based on Craig's lattices, this family is significantly smaller, in terms of alphabet-size, than previous ones in the literature.

Cited in

(3)

• Perfect codes in Euclidean lattices
• Random algebraic lattices and codes for wireless communications
• scientific article; zbMATH DE number 5763317 (Why is no real title available?)

This page was built for publication: Random Ensembles of Lattices From Generalized Reductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682832)