Methods in the Local Theory of Packing and Covering Lattices

Details Methods in the Local Theory of Packing and Covering Lattices Methods in the Local Theory of Packing and Covering Lattices

2004-12-16

arxiv.org/abs/math/0412320v2

pages 122-136 in Proceedings of "COE Workshop on Sphere Packings'', November 2004, Fukuoka, Japan

Mathematics

Metric Geometry

15 pages, (v2) Table 5 corrected

Scientific paper

In this paper we are concerned with three lattice problems: the lattice packing problem, the lattice covering problem and the lattice packing-covering problem. One way to find optimal lattices for these problems is to enumerate all finitely many, locally optimal lattices. For the lattice packing problem there are two classical algorithms going back to Minkowski and Voronoi. For the covering and for the packing-covering problem we propose new algorithms. Here we give a brief survey about these approaches. We report on some recent computer based computations where we were able to reproduce and partially extend the known classification of locally optimal lattices. Furthermore we found new record breaking covering and packing-covering lattices. We describe several methods with examples to show that a lattice is a locally optimal solution to one of the three problems.

Affiliated with

Also associated with

No associations

Rating

Methods in the Local Theory of Packing and Covering Lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Methods in the Local Theory of Packing and Covering Lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods in the Local Theory of Packing and Covering Lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-628844