Editing Sphere packing (section)

==Other spaces==
Sphere packing on the corners of a hypercube (with [[Hamming ball]]s, spheres defined by [[Hamming distance]]) corresponds to designing [[error-correcting codes]]: if the spheres have radius ''t'', then their centers are codewords of a (2''t''&nbsp;+&nbsp;1)-error-correcting code. Lattice packings correspond to linear codes. There are other, subtler relationships between Euclidean sphere packing and error-correcting codes. For example, the [[binary Golay code]] is closely related to the 24-dimensional Leech lattice.

For further details on these connections, see the book ''Sphere Packings, Lattices and Groups'' by [[John Horton Conway|Conway]] and [[Neil Sloane|Sloane]].<ref>{{Cite book|url=https://books.google.com/books?id=ITDvBwAAQBAJ|title=Sphere Packings, Lattices and Groups|last1=Conway|first1=John H.|author-link=John Horton Conway|last2=Sloane|first2=Neil J. A.|author-link2=Neil Sloane|publisher=Springer Science & Business Media|year=1998|isbn=0-387-98585-9|edition=3rd}}</ref>