scientific article; zbMATH DE number 3869218
binary Golay codeConway groupsdense sphere packingsHamming codesLeech latticeMathieu groupperfect codessimple groupssphere packingssporadic simple groups
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Combinatorial aspects of packing and covering (05B40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to group theory (20-01) Simple groups: sporadic groups (20D08) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Combinatorial codes (94B25)
The main aim of this book is to describe the history of a number of mathematical discoveries and their interconnections. The sequence starts with the origin of error-correcting codes (1947) and the subsequent discovery of perfect codes, in particular the binary Golay code (1949). From there the story proceeds via dense packings of spheres in high dimensions (1964) to the Leech lattice (1967). This leads to Conway's work on simple groups and his three sporadic simple groups (1968). Simultaneously the book describes the mathematics in question, in general in such a way that very little mathematical background is needed to understand the exposition. Through correspondence, taped interviews, and telephone conversations the author has tracked the history of these discoveries and recorded many events which influenced this wonderful area of mathematics. The first chapter describes how Hamming was led to the idea of error-correcting codes, after which Shannon's fundamental paper on the mathematical theory of communication led to the rapid development of coding theory. The main topics in the first chapter are the Hamming codes, the idea of perfect codes, and the two Golay codes. It includes an interesting description of the Hamming-Golay priority controversy. The information on other perfect codes is sketchy and incomplete. The second chapter starts with classical results on sphere packings, followed by a detailed description of Leech's work on packings in 24- dimensional space. This led to the discovery of the Leech lattice. In the final chapter one learns how difficult it was for Leech to get somebody interested in finding the automorphism groups of his lattice. When Conway finally started to work on the problem, it took less than a day to discover his groups. The most detailed part of the book is the fifty page analysis of the structure of.0. In several appendices one finds among other things tables of dense sphere packings, the sporadic simple groups, a description of the Golay code and S(5,8,24), and one of the Mathieu group \(M_{24}\). In both aims, namely the description of the mathematics itself and showing its origin and evolution, the book is successful.
- scientific article; zbMATH DE number 37568
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov
- scientific article; zbMATH DE number 4143908
- Twelve sporadic groups
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
- A group algebra construction of binary even self dual codes
- The dimensional family approach in (hyper)sphere packing: A typological study of new patterns, structures, and interdimensional functions
- On the simplicity of \(\cdot 2\) and \(\cdot 3\)
- At the dawn of the theory of codes
- Random and conditional \((t,k)\)-diagnosis of hypercubes
- Locally optimal 2-periodic sphere packings
- Sphere packing and quantum gravity
- New lower bounds for permutation arrays using contraction
- When is the ball a local pessimum for covering?
- Independent domination in hypercubes
- Sylow subgraphs in self-complementary vertex transitive graphs
- Enumerating Types of Boolean Functions
- scientific article; zbMATH DE number 37568 (Why is no real title available?)
- Lester Hill's error-detecting codes
- Improved lower bounds for kissing numbers in dimensions 25 through 31
- The work of Maryna Viazovska
- From sphere packing to Fourier interpolation
- Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions
- Elliptic genera from classical error-correcting codes
- The magic of 8 and 24
- Rank of a tensor and quantum entanglement
- The topology of projective codes and the distribution of zeros of odd maps
- A group ring construction of the \([48,24,12]\) Type II linear block code
- New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code
- Upper bounds for football pool problems and mixed covering codes
- Optimality and uniqueness of the Leech lattice among lattices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337376)