The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes (Q2121020)

It is well-known that the incidence matrix of a \(t\)-design generates a linear code over the finite field \(\mathbb{F}_q\) for any prime power \(q\), which is called the linear code of the \(t\)-design over \(\mathbb{F}_q\). Moreover, it is also known that some linear codes (depending on the supports of their codewords) hold \(t\)-designs with \(t \geq 1\). In this paper, the authors study the linear code \(C_2\) over \(\mathbb{F}_{q_2}\) of a \(t\)-design held by some other code \(C_1\) defined over the field \(\mathbb{F}_{q_1}\) (where \(\mathbb{F}_{q_2}\) depends on \(C_1\) and \(\mathbb{F}_{q_1}\)). It may happen that \(C_2 = C_1\), but they are different in many cases. The authors focus in particular on the binary case \(q_2=2\) and provide some general theoretical results, such as the parameters of \(C_2\), and the automorphism groups of \(C_1\) and \(C_2\). Finally, they consider the linear codes of some known \(t\)-designs held in the generalised Reed-Muller codes and the Simplex codes.