<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The sphere packing problem in dimension 24 · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1603.06518/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1603.06518/feed.xml" rel="self" type="application/rss+xml" /><item><title>The sphere packing problem in dimension 24 — mentioned by heinrichhartman</title><link>https://news.ycombinator.com/item?id=23360458</link><guid isPermaLink="false">urn:hackerpapers:mention:1603.06518:23360458</guid><pubDate>Sat, 30 May 2020 11:48:10 GMT</pubDate><description>&lt;p&gt;Sphere packings are quite a deep and fascinating area of pure mathemaics. It has close relations to coding theory, lattice theory, number theory, modular forms. John Conway [1] (who recently passed away due to COVID) wrote a famous book about it: Sphere Packings, Lattices and Groups -- which summarizes the subject concisely. A recent (2017) break through, was the proof that the Leech Lattice [2] yields the optimal sphere packing in dimension 24 [3]. The error correcting code constructed from this lattice is the Binary Golay Error Correcting Code [4]. It is able to correct 3 bits for every 24…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1603.06518/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.NT</category></item></channel></rss>
