A lower bound on the density of sphere packings via graph theory

International Mathematics Research Notices

Volumn , Issue 43, 2004, Pages 2271-2279

  Krivelevich, Michael ^a   Litsyn, Simon ^a   Vardy, Alexander ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4544375373     PISSN: 10737928     EISSN: None     Source Type: Journal    
DOI: 10.1155/s1073792804140464     Document Type: Article

References (10)

1. M. Ajtai, J. Komlós, and E. Szemerédi, A note on Ramsey numbers, J. Combin. Theory Ser. A 29 (1980), no. 3, 354-360.
2. K. Ball, A lower bound for the optimal density of lattice packings, Int. Math. Res. Not. 1992 (1992), no. 10, 217-221.
3. B. Bollobás, Random Graphs, Academic Press, London, 1985.
4. H. Davenport and C. A. Rogers, Hlawka's theorem in the geometry of numbers, Duke Math. J. 14 (1947), 367-375.
5. E. Hlawka, Zur geometrie der zahlen, Math. Z. 49 (1943), 285-312 (German).
6. T. Hofmeister and H. Lefmann, Independent sets in graphs with triangles, Inform. Process. Lett. 58 (1996), no. 5, 207-210.
7. T. Jiang and A. Vardy, Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes, to appear in IEEE Trans. Information Theory.
8. S. Litsyn and M. Tsfasman, Constructive high-dimensional sphere packings, Duke Math. J. 54 (1987), no. 1, 147-161.
9. H. Minkowski, Diskontinuitäsbereich für arithmetische Aequivallenz, J. reine angew. Math. 129 (1905), 220-274 (German).
10. A. Rogers, Existence theorems in the geometry of numbers, Ann. of Math. (2) 48 (1947), 994-1002.