A lower bound on packing density
From MaRDI portal
Publication:1112098
DOI10.1007/BF01393834zbMath0659.10033MaRDI QIDQ1112098
Publication date: 1989
Published in: Inventiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/143740
Lattices and convex bodies (number-theoretic aspects) (11H06) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31)
Related Items
On the construction of dense lattices with a given automorphisms group ⋮ An indexed set of density bounds on lattice packings ⋮ Compositions of sums of absolute powers ⋮ Dense packings from algebraic number fields and codes ⋮ A note on lattices of rational functions ⋮ Random algebraic lattices and codes for wireless communications ⋮ Constructive packings of cross polytopes ⋮ Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets ⋮ Constructive spherical codes near the Shannon bound ⋮ A Gilbert-Varshamov-type bound for lattice packings ⋮ A Note on Lattice Packings via Lattice Refinements ⋮ Packing superballs from codes and algebraic curves ⋮ On the packing densities of superballs and other bodies ⋮ Lattice packing of nearly-euclidean balls in spaces of even dimension ⋮ Dense packings from quadratic fields and codes ⋮ Lattice packing and covering of convex bodies ⋮ Exponential improvements for superball packing upper bounds ⋮ A bound, and a conjecture, on the maximum lattice‐packing density of a superball ⋮ On the density of cyclotomic lattices constructed from codes
Cites Work
