Scinovex
articleTop 1% cited

Sphere Packings, Lattices and Groups.

American Mathematical Monthly · 1989 · Vol. 96(6) · pp. 538–538
H. S. M. CoxeterJ. H. ConwayN. J. A. Sloane

Abstract

The second edition of this book continues to pursue the question: what is the most efficient way to pack a large number of equal spheres in n-dimensional Euclidean space? The authors also continue to examine related problems such as the kissing number problem, the covering problem, the quantizing problem, and the classification of lattices and quadratic forms. Like the first edition, the second edition describes the applications of these questions to other areas of mathematics and science such as number theory, coding theory, group theory, analog-to-digital conversion and data compression, n-dimensional crystallography, and dual theory and superstring theory in physics.

Advanced Materials and MechanicsCellular Automata and ApplicationsCrystallographyMathematicsCombinatoricsMaterials scienceChemistry

Funding

  • Division of Mathematical Sciences
Citations
3,444
FWCI
111.22
field-weighted impact
References
4
Percentile
100%
vs. same field & year
Citations per year
Cited by
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory · 1999 · 1,550 citations
Achieving near-capacity on a multiple-antenna channel
IEEE Transactions on Communications · 2003 · 2,033 citations
On the sphere-decoding algorithm I. Expected complexity
IEEE Transactions on Signal Processing · 2005 · 1,194 citations
Quantum error correction via codes over GF(4)
IEEE Transactions on Information Theory · 1998 · 1,753 citations
Grassmannian beamforming for multiple-input multiple-output wireless systems
IEEE Transactions on Information Theory · 2003 · 1,520 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.