Spherical code in \(n\) dimensions whose codewords correspond to points in an orbit of some initial vector under a generating group \(G\), which is a subgroup of the group \(O(n)\) of rotations in \(n\) dimensions. Neither the vector nor the group are unique for a given code.
Code properties depend on the relationship between the group and the initial vector, and the number of codewords is the number of cosets of an initial vector's symmetry subgroup in \(G\) per the orbit-stabilizer theorem. See Refs.  for allowed code parameters.
See [8; Ch. 8] for more details and code tables.
- Spherical code
- Group-orbit code — Slepian group-orbit codes are group-orbit codes on spheres. Binary group-orbit codes can be mapped into Slepian group-orbit codes via various mappings [8; Ch. 8].
- Permutation spherical code — Permutations and sign changes can be implemented on vectors by orthogonal matrices, so permutation spherical codes are Slepian group-orbit codes.
- Real-Clifford subgroup-orbit code
- Torus-layer spherical code (TLSC) — Polyphase codewords can be implemented by acting on the all-ones initial vector by diagonal orthogonal matrices whose entries are the codeword components [8; Ch. 8]. TLSC codes are generalizations of polyphase codes to other initial vectors and are examples of abelian Slepian-group codes.
- Polytope code — Vertices of polytope codes typically form an orbit of the polytope's symmetry group.
- Linear binary code — Any length-\(n\) binary linear code can be used to define a diagonal subgroup of \(n\)-dimensional rotation matrices with \(\pm 1\) on the diagonals via the antipodal mapping \(0\to+1\) and \(1\to-1\). The orbit of this subgroup yields the corresponding Slepian group-orbit code; see [8; Thm. 8.5.2].
- Binary antipodal code — Any length-\(n\) binary linear code can be used to define a diagonal subgroup of \(n\)-dimensional rotation matrices with \(\pm 1\) on the diagonals via the antipodal mapping \(0\to+1\) and \(1\to-1\). The orbit of this subgroup yields the corresponding Slepian group-orbit code; see [8; Thm. 8.5.2].
- Linear code over \(G\) — Any finite-group code can be mapped to a Slepian group-orbit code by representing the group using orthogonal matrices .
- D. Slepian, “Group Codes for the Gaussian Channel”, Bell System Technical Journal 47, 575 (1968) DOI
- H.-A. Loeliger, “Signal sets matched to groups”, IEEE Transactions on Information Theory 37, 1675 (1991) DOI
- T. Mittelholzer and J. Lahtonen, “Group codes generated by finite reflection groups”, IEEE Transactions on Information Theory 42, 519 (1996) DOI
- Biggs, Norman. Finite groups of automorphisms: course given at the University of Southampton, October-December 1969. Vol. 6. CUP Archive, 1971.
- C. Downey and J. Karlof, “On the existence of&lt;tex&gt;[M, n]&lt;/tex&gt;group codes for the Gaussian channel with&lt;tex&gt;[M, n]&lt;/tex&gt;odd”, IEEE Transactions on Information Theory 23, 500 (1977) DOI
- J. Karlof and C. Downey, “Odd Group Codes for The Gaussian Channel”, SIAM Journal on Applied Mathematics 34, 715 (1978) DOI
- R. M. Siqueira and S. I. R. Costa, “Flat tori, lattices and bounds for commutative group codes”, Designs, Codes and Cryptography 49, 307 (2008) DOI
- T. Ericson, and V. Zinoviev, eds. Codes on Euclidean spheres. Elsevier, 2001.
- I. Ingemarsson, “Group Codes for the Gaussian Channel”, Lecture Notes in Control and Information Sciences 73 DOI
Page edit log
- Victor V. Albert (2022-11-18) — most recent
“Slepian group-orbit code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/slepian_group