Construction of Extremal Type II Codes over \mbox{\zZ}_4
Designs, Codes and Cryptography
Weights modulo pe of linear codes over rings
Designs, Codes and Cryptography
Linear codes over $${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$$
Designs, Codes and Cryptography
On the decomposition of self-dual codes over F2+uF2 with an automorphism of odd prime order
Finite Fields and Their Applications
On the classification and enumeration of self-dual codes
Finite Fields and Their Applications
| Hi-index | 754.84 |
In previous work by Huffman and by Yorgov (1983), a decomposition theory of self-dual linear codes C over a finite field Fq was given when C has a permutation automorphism of prime order r relatively prime to q. We extend these results to linear codes over the Galois ring Z4 and apply the theory to Z4-codes of length 24. In particular we obtain 42 inequivalent [24,12] Z4-codes of minimum Euclidean weight 16 which lead to 42 constructions of the Leech lattice