On the construction of dense lattices with a given automorphisms group

DOI10.5802/aif.2286zbMath1172.11021arXivmath/0605098OpenAlexW2963757067MaRDI QIDQ2372823

Gilles Zémor, Philippe Gaborit

Publication date: 1 August 2007

Published in: Annales de l'Institut Fourier (Search for Journal in Brave)

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

zbMATH Keywords

automorphism groupprobabilitylattice packingdouble circulant codesMinkowski-Hlawka lower bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Relations with coding theory (11H71)

Related Items (6)

Dense packings from algebraic number fields and codes ⋮ Local Testing of Lattices ⋮ A Gilbert-Varshamov-type bound for lattice packings ⋮ A Note on Lattice Packings via Lattice Refinements ⋮ A NEW INEQUALITY FOR THE HERMITE CONSTANTS ⋮ On the density of cyclotomic lattices constructed from codes

Cites Work

• A lower bound on packing density
• Hlawka's theorem in the geometry of numbers
• Existence theorems in the geometry of numbers
• An improvement to the Minkowski‐Hiawka bound for packing superballs
• Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the construction of dense lattices with a given automorphisms group