×

geometry. (English) Zbl 1431.94164

Summary: We examine some self-orthogonal codes constructed from a rank-5 primitive permutation representation of degree 1100 of the sporadic simple group \(\mathrm{HS}\) of Higman-Sims. We show that \(\operatorname{Aut}(C) = \mathrm{HS}:2\), where \(C\) is a code of dimension 21 associated with Higman’s geometry.

MSC:

94B05 Linear codes (general theory)
05B05 Combinatorial aspects of block designs
20D08 Simple groups: sporadic groups
94B25 Combinatorial codes

Software:

Magma

References:

[1] E. F. Assmus, Jr and J. D. Key. Designs and their Codes. Cambridge: Cambridge University Press, 1992. Cambridge Tracts in Mathematics, Vol. 103 (Second printing with corrections, 1993). · Zbl 0762.05001
[2] W. Bosma, J. Cannon, C. Playoust. The Magma algebra system I: The user language. J. Symbolic Comput. 24 (1997), 235-265. · Zbl 0898.68039
[3] A. R. Calderbank and D. B. Wales. A global code invariant under the Higman-Sims group. J. Algebra, 75 (1982), 233-260. · Zbl 0492.20011
[4] J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker, and R.A. Wilson. Atlas of Finite Groups. Oxford University Press, Oxford, 1985. · Zbl 0568.20001
[5] T. Connor and D. Leemans. An atlas of subgroup lattices of finite almost simple groups. Ars Math. Contemp., 8, (2015), 259-266. · Zbl 1325.20019
[6] T. Connor and D. Leemans. An atlas of subgroup lattices of finite almost simple groups, 2014. http://homepages.ulb.ac.be/ tconnor/atlaslat/hsd2.pdf accessed July 2015. · Zbl 1325.20019
[7] D. Crnkovi´c and V. Mikuli´c. Unitals, projective planes and other combinatorial structures constructed from the unitary groups U 3(q) q = 3, 4, 5, 7. Ars Combin., 110, (2013), 3-13. the electronic journal of combinatorics 23(4) (2016), #P4.15 11 · Zbl 1313.05361
[8] D. Crnkovi´c and V. Mikuli´c, and B. G. Rodrigues. Designs, strongly regular graphs and codes constructed from some primitive groups. In Information Security, Coding Theory and Related Combinatorics (D. Crnkovi´c & V. Tonchev, Eds.), IOS Press, Amsterdam, 2011, pages 231-252. · Zbl 1323.05139
[9] G. Higman. On the simple group of D. G. Higman and C. C. Sims. Illinois J. Math., 13 (1969), 74-80. · Zbl 0165.04001
[10] J. D. Key and J. Moori, Codes. Designs and Graphs from the Janko Groups J 1 and J 2, J. Combin. Math. Combin. Comput., 40 (2002), 143-159. · Zbl 0999.05010
[11] J. D. Key and J. Moori. Correction to: Codes, designs and graphs from the Janko groups J 1 and J 2[J. Combin. Math. Combin. Comput. 40 (2002), 143-159]. J. Com bin. Math. Combin. Comput., 64 (2008), 153. · Zbl 0999.05010
[12] J. D. Key and J. Moori, B. G. Rodrigues. On some designs and codes from primitive representations of some finite simple groups. J. Combin. Math. Combin. Comput., 45 (2003), 3-19. · Zbl 1045.05014
[13] W. Knapp and H. -J. Schaeffer. On the codes related to the Higman-Sims graph. Electron. J. Combin., 22 (1) (2015), #P1.19. · Zbl 1308.94109
[14] S. S. Magliveras. The Subgroup Structure of the Higman-Sims Simple group. Bull. Amer. Math. Soc., 77 (1971), no. 4, 535-539. · Zbl 0226.20012
[15] J. Moori and B. G. Rodrigues. On some designs and codes invariant under the Higman-Sims group. Util. Math., 86 (2011), 225-239. · Zbl 1264.05013
[16] B. G. Rodrigues. Some new 2-designs and complementary dual codes related to the Higman-Sims group. Submitted.
[17] C. M. Roney-Dougal and W. R. Unger. The affine primitive permutation groups of degree less than 1000. J. Symbolic Comput., 35 (2003), no. 4, 421-439. · Zbl 1047.20005
[18] V. D. Tonchev. Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs. IEEE Trans. Info. Theory, 43 (1997), 1021-1025. · Zbl 0926.94030
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.