On the codes related to the Higman-Sims graph
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Simple groups: sporadic groups (20D08) Combinatorial codes (94B25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Summary: All linear codes of length \(100\) over a field \(F\) which admit the Higman-Sims simple group HS in its rank \(3\) representation are determined. By group representation theory it is proved that they can all be understood as submodules of the permutation module \(F\Omega\) where \(\Omega\) denotes the vertex set of the Higman-Sims graph. This module is semisimple if \(\mathrm{char} F\neq 2,5\) and absolutely indecomposable otherwise. Also if \(\mathrm{char} F \in \{2, 5\}\) the submodule lattice is determined explicitly. The binary case \(F = \mathbb{F}_2\) is studied in detail under coding theoretic aspects. The HS-orbits in the subcodes of dimension \(\leq 23\) are computed explicitly and so also the weight enumerators are obtained. The weight enumerators of the dual codes are determined by MacWilliams transformation. Two fundamental methods are used: Let \(v\) be the endomorphism determined by an adjacency matrix. Then in \(H_{22} = \mathrm{Im} v \) the HS-orbits are determined as \(v\)-images of certain low weight vectors in \(F\Omega\) which carry some special graph configurations. The second method consists in using the fact that \(H_{23}/H_{21}\) is a Klein four group under addition, if \(H_{23}\) denotes the code generated by \(H_{22}\) and a ``Higman vector \(x(m)\) of weight 50 associated to a heptad \(m\) in the shortened Golay code \(G_{22}\), and \(H_{21}\) denotes the doubly even subcode of \(H_{22}\leq H_{78} = {H_{22}}^\perp\). Using the mentioned observation about \(H_{23}/H_{21}\) and the results on the HS-orbits in \(H_{23}\) a model of G. Higman's geometry is constructed, which leads to a direct geometric proof that G. Higman's simple group is isomorphic to HS. Finally, it is shown that almost all maximal subgroups of the Higman-Sims group can be understood as stabilizers in HS of codewords in \(H_{23}\).
- Linear codes with complementary duals related to the complement of the Higman-Sims graph
- On some designs and codes invariant under the Higman-Sims group
- geometry
- Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs
- 2-designs and codes from simple groups \(L_3(q)\) and Higman-Sims sporadic simple group \(\mathrm{HS}\)
- A combinatorial configuration associated with the Higman-Sims simple group
- A global code invariant under the Higman-Sims group
- A simple group of order 44,352,000
- Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs
- Binary codes of strongly regular graphs
- Characters of the covering group of the Higman-Sims group
- Codes with prescribed permutation group
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 3670663 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284417 (Why is no real title available?)
- scientific article; zbMATH DE number 775176 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- scientific article; zbMATH DE number 3326517 (Why is no real title available?)
- scientific article; zbMATH DE number 3341276 (Why is no real title available?)
- Intersection matrices for finite permutation groups
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- On the connection between the ordinary and the modular characters of groups of finite order
- On the graphs of Hoffman-Singleton and Higman-Sims
- On the isomorphism of two simple groups of order 44,352,000
- On the simple group of D.G. Higman and C.C. Sims
- Power moment identities on weight distributions in error correcting codes
- Primitive rank 3 groups with a prime subdegree
- The maximal subgroups of M24
- The modular characters of the Mathieu groups
- The Multiplier of the Higman-Sims Simple Group
- The subgroup structure of the Higman-Sims simple group
- Transitive Erweiterungen endlicher Permutationsgruppen
- Vertices and sources
- Über Steinersche Systeme
- The 3- and 5-modular characters of the covering and the automorphism groups of the Higman-Sims group
- A projective two-weight code related to the simple group \(\mathrm{Co}_1\) of Conway
- On the existence of PD-sets: algorithms arising from automorphism groups of codes
- A useful tool for constructing linear codes
- Codes and \(L(2,1)\)-labelings in Sierpiński graphs
- On some designs and codes invariant under the Higman-Sims group
- scientific article; zbMATH DE number 6386261 (Why is no real title available?)
- Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs
- Linear codes with complementary duals related to the complement of the Higman-Sims graph
- Linear closures of finite geometries
- On linear codes admitting large automorphism groups
- On some codes from rank 3 primitive actions of the simple Chevalley group G₂(q)
- geometry
This page was built for publication: On the codes related to the Higman-Sims graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256113)
