A criterion for designs in \({\mathbb Z}_4\)-codes on the symmetrized weight enumerator (Q1412247): Difference between revisions

The Assmus-Mattson theorem is a well-known method to find designs in linear codes over a finite field. The lifted Golay code \(G_{24}\) over \(\mathbb{Z}_4\) has been shown by several authors to contain 5-designs. Hence it is an interesting and important problem to find an analog to this theorem for \(\mathbb{Z}_4\) codes. Shin gave an Assmus-Mattson theorem for \(\mathbb{Z}_4\) codes based on the Hamming weight enumerator, but this cannot find 5-designs in \(G_{24}\). \textit{K. Tanabe} developed a theorem based on the symmetric weight enumerator [c.f. IEEE Trans. Inf. Theory 46, 48--53 (2000; Zbl 0998.94028)], but it is computationally difficult. In this paper, a condition presented by Shin is used to improve the theorem by Tanabe. This theorem is used to find 5-designs in \(G_{24}\).