Sphere Packings, Lattices and Groups
Grundlehren der mathematischen WissenschaftenPublished 1 January 1993
John H. Conway, N. J. A. Sloane
Citations871
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
The second edition of this timely, definitive, and popular book continues to pursue the question: what is the most efficient way to pack a large number of equal spheres in n-dimensional Euclidean spac
Keywords
Computer ScienceEngineering
Grundlehren der mathematischen WissenschaftenVoronoi Cells of Lattices and Quantization Errors
5 Citations1999J. H. Conway, N. J. A. Sloane
Grundlehren der mathematischen WissenschaftenA Characterization of the Leech Lattice
3 Citations1988J. H. Conway
Grundlehren der mathematischen WissenschaftenEnumeration of Unimodular Lattices
2 Citations1999J. H. Conway, N. J. A. Sloane
arXiv (Cornell University)On an error-correcting code problem
2 Citations2017José Manuel Gómez Soto, Jesús Leaños +2 more
This paper solves the open problem of determine the maximum size of a binary code of constant weight 2 by finding the packing number of the double vertex graph (2-token graph) of a path graph that is isomorphic to the Sloane's graph.
Grundlehren der mathematischen WissenschaftenFinding the Closest Lattice Point
1 Citations1993John H. Conway, N. J. A. Sloane
This chapter describes algorithms which, given an arbitrary point of R n , find the closest point of some given lattice, which can be used for vector quantizing or for decoding lattice codes for a bandlimited channel.