AbstractA Gilbert–Varshamov-type bound for Euclidean packings was recently found by Nebe and Xing. In this present paper, we derive a Gilbert–Varshamov-type bound for lattice packings by generalizing Rush's approach of combining p-ary codes with the lattice pZn. Specifically, we will exploit suitable sublattices of Zn as well as lattices of number fields in our construction. Our approach allows us to compute the center densities of lattices of moderately large dimensions which compare favorably with the best known densities given in the literature as well as the densities derived directly via Rush's method
Let p be an odd prime. A family of (p - 1)-dimensional over-lattices yielding new record packings fo...
Abstract. The sphere packing problem asks for the greatest density of a packing of congruent balls i...
Abstract. The sphere packing problem asks for the greatest density of a packing of congruent balls i...
Includes bibliographical references (p. 23)For every positive integer n, the classical sphere packin...
The Minkowski-Hlawka bound implies that there exist lattice packings of n-dimensional ‘‘superballs’ ...
A lower bound of the form (2n/n+1)1/nγn-1/n n-1 is derived on the coding gain γn of the densest n-di...
We consider the problem of constructing dense lattices of R^n with a given automorphism group. We ex...
We construct a new family of lattice packings for superballs in three dimensions (unit balls for the...
This document is composed of a series of articles in discrete geometry, each solving a problem in pa...
10 pages. Corrected typos and ambiguous definitionInternational audienceWe consider the problem of c...
AbstractIn the present paper, we make use of the quadratic field Q(−3) to construct dense packings i...
10 pages. Corrected typos and ambiguous definitionInternational audienceWe consider the problem of c...
Abstract. Barnes and Sloane recently described a "general construction " for lattice packi...
In this paper we present a method for evaluating the center density of algebraic lattices from subfi...
In this paper we present a method for evaluating the center density of algebraic lattices from subfi...
Let p be an odd prime. A family of (p - 1)-dimensional over-lattices yielding new record packings fo...
Abstract. The sphere packing problem asks for the greatest density of a packing of congruent balls i...
Abstract. The sphere packing problem asks for the greatest density of a packing of congruent balls i...
Includes bibliographical references (p. 23)For every positive integer n, the classical sphere packin...
The Minkowski-Hlawka bound implies that there exist lattice packings of n-dimensional ‘‘superballs’ ...
A lower bound of the form (2n/n+1)1/nγn-1/n n-1 is derived on the coding gain γn of the densest n-di...
We consider the problem of constructing dense lattices of R^n with a given automorphism group. We ex...
We construct a new family of lattice packings for superballs in three dimensions (unit balls for the...
This document is composed of a series of articles in discrete geometry, each solving a problem in pa...
10 pages. Corrected typos and ambiguous definitionInternational audienceWe consider the problem of c...
AbstractIn the present paper, we make use of the quadratic field Q(−3) to construct dense packings i...
10 pages. Corrected typos and ambiguous definitionInternational audienceWe consider the problem of c...
Abstract. Barnes and Sloane recently described a "general construction " for lattice packi...
In this paper we present a method for evaluating the center density of algebraic lattices from subfi...
In this paper we present a method for evaluating the center density of algebraic lattices from subfi...
Let p be an odd prime. A family of (p - 1)-dimensional over-lattices yielding new record packings fo...
Abstract. The sphere packing problem asks for the greatest density of a packing of congruent balls i...
Abstract. The sphere packing problem asks for the greatest density of a packing of congruent balls i...