Description
Spherical \((4,24,1)\) code whose codewords are the vertices of the 24-cell. Codewords form the minimal lattice-shell code of the \(D_4\) lattice. A realization of the codewords consists of the 24 permutations of the four vectors \((0,0,\pm 1,\pm 1)\); see [1; Table 3] for another realization. A realization in terms of quaternions yields the 24 elements of the binary tetrahedral group \(2T\) [2].
Protection
Notes
See post by G. Egan for more details.
Parents
- 600-cell code — Vertices of a 600-cell can be split up into vertices of five 24-cells [5–7].
- Disphenoidal 288-cell code — Vertices of a disphenoidal 288-cell can be split up into vertices of a 24-cell and its dual 24-cell [2; Sec. 8.6].
- Real-Clifford subgroup-orbit code — The 24-cell code is equivalent to the real Clifford subgroup-orbit code for \(n=4\).
- Spherical design code — The 24-cell code is a spherical 5-design [8].
Cousins
- Universally optimal spherical code — The 24-cell code is not universally optimal [8], but comes quite close [9; Ex. 12.4.29].
- Kerdock code — The 24-cell is a special case of a family of codes for real projective planes, constructed using Kerdock codes [10] (cf. [11]).
- Sharp configuration — The 12 sets of antipodal pairs of the 24-cell code form a sharp configuration in the projective space \(\mathbb{R}P^3\) [12].
- Biorthogonal spherical code — Vertices of a 24-cell can be split up into vertices of three 16-cells, which are biorthogonal spherical codes for \(n=4\) [6].
- Clifford subgroup-orbit QSC — Logical constellations of the Clifford subgroup-orbit code for \(r=1\) form vertices of 24-cells when mapped into the real sphere, while code constellations form vertices of a disphenoidal 288-cell.
References
- [1]
- S. Mamone, G. Pileio, and M. H. Levitt, “Orientational Sampling Schemes Based on Four Dimensional Polytopes”, Symmetry 2, 1423 (2010) DOI
- [2]
- L. Rastanawi and G. Rote, “Towards a Geometric Understanding of the 4-Dimensional Point Groups”, (2022) arXiv:2205.04965
- [3]
- Schläfli, L. (1901). Theorie der vielfachen Kontinuität (Vol. 38). Zürcher & Furrer.
- [4]
- O. R. Musin, “The kissing number in four dimensions”, (2006) arXiv:math/0309430
- [5]
- Schoute, P. H. (1903). Mehrdimensionale Geometrie, Vol. 2 (Die Polytope).
- [6]
- H. S. M. Coxeter. Regular polytopes. Courier Corporation, 1973.
- [7]
- M. Waegell and P. K. Aravind, “Critical noncolorings of the 600-cell proving the Bell–Kochen–Specker theorem”, Journal of Physics A: Mathematical and Theoretical 43, 105304 (2010) arXiv:0911.2289 DOI
- [8]
- H. Cohn et al., “TheD\({}_{\text{4}}\)Root System Is Not Universally Optimal”, Experimental Mathematics 16, 313 (2007) arXiv:math/0607447 DOI
- [9]
- P. Boyvalenkov, D. Danev, "Linear programming bounds." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021) DOI
- [10]
- Levenshtein, V. I. (1982). Bounds on the maximal cardinality of a code with bounded modulus of the inner product. In Soviet Math. Dokl (Vol. 25, No. 2, pp. 526-531).
- [11]
- H. Cohn, A. Kumar, and G. Minton, “Optimal simplices and codes in projective spaces”, Geometry & Topology 20, 1289 (2016) arXiv:1308.3188 DOI
- [12]
- H. Cohn and A. Kumar, “Universally optimal distribution of points on spheres”, Journal of the American Mathematical Society 20, 99 (2006) arXiv:math/0607446 DOI
Page edit log
- Victor V. Albert (2022-11-23) — most recent
Cite as:
“24-cell code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/24cell