×

Designs, strongly regular graphs and codes constructed from some primitive groups. (English) Zbl 1323.05139

Crnković, Dean (ed.) et al., 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 (ISBN 978-1-60750-662-1/hbk; 978-1-60750-663-8/ebook). NATO Science for Peace and Security Series D: Information and Communication Security 29, 231-252 (2011).
Summary: Let \(G\) be a finite group acting primitively on the sets \(\Omega_1\) and \(\Omega_2\). We describe a construction of 1-designs with block set \(\Omega_1\) and block set \(\Omega_2\), having \(G\) as an automorphism group. Applying this construction method we obtain a unital \(2-(q^3+1, q+1, 1)\), and a semi-symmetric \((q^4-q^3+q^2, q^2-q, (1))\) from the unitary group \(U_3(q)\), where \(q = 3, 4, 5, 7\). From the unital and the semi-symmetric design we build a projective plane \(\mathrm{PG}(2, q^2)\). Further, we describe other combinatorial structures constructed from these unitary groups and structures constructed from \(U_4(2), U_4(3)\) and \(L_2(49)\).
We also construct self-orthogonal codes obtained from the row span over \(\mathbb{F}_2\) or \(\mathbb{F}_3\) of the incidence (resp. adjacency) matrices of mostly self-orthogonal designs (resp. strongly regular graphs) defined by the action of the simple unitary groups \(U_3(q)\) for \(q = 3, 4, 7\) and \(U_4(q)\) for \(q = 2, 3\) and the linear group \(L_2(49)\) on the conjugacy classes of some of their maximal subgroups. Some of the codes are optimal or near optimal for the given length and dimension.
For the entire collection see [Zbl 1276.94001].

MSC:

05E30 Association schemes, strongly regular graphs
05E15 Combinatorial aspects of groups and algebras (MSC2010)
05B05 Combinatorial aspects of block designs
94B60 Other types of codes
Full Text: DOI