Designs and codes from basic 3-transpositions (Q2081682)

A 1-design with parameters \((v,k,\lambda)\) is an incidence structure \(\mathcal{D}=(\mathcal{P},\mathcal{B})\) where \(\mathcal{P}\) is a set of \(v\) points and \(\mathcal{B}\) is a collection of \(k\)-subsets of \(\mathcal{P}\) called blocks such that each point is contained in \(\lambda\) blocks. Let \(G\) be a finite group generated by a class \(D\) of involutions such that any pair of non-commuting elements of \(D\) generate a dihedral group of order 6. Then \(D\) is called a class of conjugates 3-transpositions, and \(G\) is said to be a 3-transpositions group. Any maximal set of pairwise 3-transpositions is called a basic set of transpositions. In this paper, the author studies maximal pairwise commuting sets of 3-transpositions and constructs designs and codes from these sets. For a 3-transposition group \(G\) with \(D\) a conjugacy class consisting 3-transpositions and the set \(L\) of basic transpositions in \(D\), the author give a general description of 1-\((v, k, \lambda)\) designs \(\mathcal{D}= (\mathcal{P},\mathcal{B})\), with \(\mathcal{P} = D\) and \(\mathcal{B}=\{L^g\mid g\in G\}\), see Section 4. The author also applies this method to symmetric groups and Fischer families of sporadic simple groups and obtains these designs and some codes associated to them.