5-designs from the lifted Golay code over \(Z_4\) via an Assmus-Mattson type approach (Q5951956)

Recall that the symmetric weight enumerator of a code \(C\) over \(Z_4\) is the sum NEWLINE\[NEWLINE\sum_{c\in C}W^{n_0(c)}X^{n_1(c)+n_3(c)}Y^{n_2(c)},NEWLINE\]NEWLINE where \(n_i(c), 1\leq i \leq 3,\) is the number of appearances of the digit \(i\) in the codeword \(c\). An alternative proof that the supports of the codewords of Hamming weight 12 in the lifted Golay code over \(Z_4\) of each of the two possible symmetric weight enumerator types form a 5-(24,12,1584) design is offered using an Assmus-Mattson-type approach. These 5-designs were first obtained via computer search by \textit{M. Harada} [see e.g. J. Comb. Des. 6, 225-229 (1998; Zbl 0916.05007)] and proved to be so analytically by \textit{A. Bonnecaze, E. Rains,} and \textit{P. Solé} [J. Stat. Plann. Inference 86, 349-368 (2000; Zbl 0974.05009)]. The paper is concluded with the weight hierarchy of the lifted Golay code over \(Z_4\).