5-designs from the lifted Golay code over Z₄ via an Assmus-Mattson type approach
5-designs from the lifted Golay code over \(Z 4\) via an Assmus-Mattson type approach
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\).
- New 5-designs constructed from the lifted Golay code over ?4
- 3-colored 5-designs and \(\mathbb{Z}_4\)-codes
- On \(t\)-designs from codes over \(\mathbb{Z}_4\)
- An Assmus-Mattson-type approach for identifying 3-designs from linear codes over \(\mathbb{Z}_4\)
- New 3-designs from Goethals codes over \(Z_4\)
- Coding and Cryptography
- \(5\)-SEEDs from the lifted Golay code of length \(24\) over \(\mathbb{Z}_4\)
- Extremal double circulant type II codes over \(\mathbb Z_4\) and construction of 5-(24,10,36) designs.
- On Z/sub 4/- and Z/sub 9/-linear lifts of the Golay codes
This page was built for publication: 5-designs from the lifted Golay code over \(Z_4\) via an Assmus-Mattson type approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951956)