373
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

A Note on Lattice Packings via Lattice Refinements

Pages 1-9 | Published online: 20 Sep 2016
 

ABSTRACT

Rogers proved in a constructive way that every packing lattice Λ of a symmetric convex body K in is contained in a packing lattice whose covering radius is less than 3. By a slight modification of Rogers’ approach better bounds for lp-balls are obtained. Together with Rogers’ constructive proof, this leads, for instance, to a simple o(nn/2) running time algorithm that refines successively the packing lattice Dn (checkboard lattice) of the unit ball Bn and terminates with a packing lattice with density . We have also implemented this algorithm and in small dimensions (⩽ 25) and for certain simple structured start lattices like or Dn the algorithm often terminates with packing lattices achieving the best-known lattice densities.

2000 AMS SUBJECT CLASSIFICATION:

Notes

On a 3.1 GHz Intel Core i7 processor.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 360.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.