2008
DOI: 10.1142/s1793042108001262
|View full text |Cite
|
Sign up to set email alerts
|

A Family of Asymptotically Good Lattices Having a Lattice in Each Dimension

Abstract: A new constructive family of asymptotically good lattices with respect to sphere packing density is presented. The family has a lattice in every dimension n ≥ 1. Each lattice is obtained from a conveniently chosen integral ideal in a subfield of the cyclotomic field ℚ(ζq) where q is the smallest prime congruent to 1 modulo n.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0
1

Year Published

2011
2011
2020
2020

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 4 publications
0
6
0
1
Order By: Relevance
“…, the packing radius of A (i) p−1 is lower bounded by √ pi/2; see [2]. Moreover, for large n = p − 1, these lattice packings satisfy…”
Section: Introductionmentioning
confidence: 92%
“…, the packing radius of A (i) p−1 is lower bounded by √ pi/2; see [2]. Moreover, for large n = p − 1, these lattice packings satisfy…”
Section: Introductionmentioning
confidence: 92%
“…The following result can be compared with the construction of the Craiglike lattices in [3]. Our lattices are obviously denser, since in their construction the prime number q is required to be the smallest prime q satisfying q ≡ 1 mod n. When (> n) is a prime number, the generalized Craig lattice A Proof.…”
Section: Generalization Of Craig Latticesmentioning
confidence: 99%
“…from error-correcting codes, algebraic number fields and algebraic varieties have been proposed by many authors and stimulated many further works ( [22,23,6,10,11,25,12,13,14,3,15,28]). Recently the Leech lattice, which was found in 1965 in [22], has been proved to be the unique densest lattice packing of dimension 24 (see [4,5]).…”
Section: Introductionmentioning
confidence: 99%
“…From Theorem 2.1 we have the following analogous Craig lattices for all dimensions with "not bad" densities. The following result can be compared with the construction of Craig-like lattices in [7]. It is obvious our lattices are denser, since in their construction the prime number q is required to be the smallest prime q satisfying q ≡ 1 mod n.…”
Section: It Is a Cyclic Latticementioning
confidence: 99%
“…Many known densest sphere packings are lattice packings or packings from finitely many translates of lattices(see [11,12,31,47,48]). Constructing lattice sphere packings from error-correcting codes, algebraic number fields and algebraic geometry have been proposed by many authors and stimulated many further works( [30,31,11,15,16,2,36,37,38,33,34,23,24,17,18,19,7,20,42,43,35,47,48,40,41]). Recently Leech lattice, which was found in 1965 in [30], has been proved to be the unique densest lattice packing in dimension 24 (see [9,10]).…”
Section: Introductionmentioning
confidence: 99%