A criterion for designs in \({\mathbb Z}_4\)-codes on the symmetrized weight enumerator (Q1412247): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 04:16, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A criterion for designs in \({\mathbb Z}_4\)-codes on the symmetrized weight enumerator |
scientific article |
Statements
A criterion for designs in \({\mathbb Z}_4\)-codes on the symmetrized weight enumerator (English)
0 references
10 November 2003
0 references
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}\).
0 references
\(Z_4\) codes
0 references
Assmus-Mattson theorem
0 references
weight enumerator
0 references