On the automorphisms of designs constructed from finite simple groups

From MaRDI portal



Abstract: Here we study the automorphism groups of 1-designs constructed from finite nonabelian simple groups by using two methods presented in Moori (Information Security, Coding Theory and Related Combinatorics, 2011). We obtain some general results for both and improve one of these methods. In an application to the sporadic Mathieu groups Mn, we are able to retrieve the Steiner systems S(t,t+3,n) where (n,t)in(22,3),(23,4),(24,5).


The automorphism groups of designs that are constructed from finite simple groups are studied in this paper. The 1-designs with important applications in coding theory are emphasized. The results generalize and extend those in [\textit{J. Moori}, in: Information security, coding theory and related combinatorics. Information coding and combinatorics. Based on lectures presented at the NATO Advanced Study Institute, Opatija, Croatia, May 31 -- June 11, 2010. Amsterdam: IOS Press. 202--230 (2011; Zbl 1366.05015)].




Cited in
(30)


Describes a project that uses

Uses Software






This page was built for publication: On the automorphisms of designs constructed from finite simple groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494586)