On the density of cyclotomic lattices constructed from codes

DOI10.1142/S1793042117500695zbMath1426.11067arXiv1603.00743MaRDI QIDQ5269116

Philippe Moustrou

Publication date: 15 June 2017

Published in: International Journal of Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

linear codescyclotomic fieldslattice sphere packingsMinkowski-Hlawka bound

Mathematics Subject Classification ID

Lattice packing and covering (number-theoretic aspects) (11H31) Relations with coding theory (11H71)

Related Items (2)

On the density of sets of the Euclidean plane avoiding distance 1 ⋮ Coloring the Voronoi tessellation of lattices

Cites Work

• Improved sphere packing lower bounds from Hurwitz lattices
• Upper bounds for Euclidean minima of algebraic number fields
• Optimality and uniqueness of the Leech lattice among lattices
• A lower bound on packing density
• On the construction of dense lattices with a given automorphisms group
• Hlawka's theorem in the geometry of numbers
• Existence theorems in the geometry of numbers
• A mean value theorem in geometry of numbers
• Algorithms for the Shortest and Closest Lattice Vector Problems
• A Note on Sphere Packings in High Dimension
• On the geometry of numbers
• Abelian varieties and a Minkowski-Hlawka theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the density of cyclotomic lattices constructed from codes