Graphs, Codes and Designs
On Harmonic Weight Enumerators of Binary Codes
Designs, Codes and Cryptography
Cyclic codes and quadratic residue codes over Z4
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
An Assmus-Mattson theorem for Z4-codes
IEEE Transactions on Information Theory
Quaternary quadratic residue codes and unimodular lattices
IEEE Transactions on Information Theory
New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
European Journal of Combinatorics
Hi-index | 0.01 |
The Assmus–Mattson theorem is known as a method to find designs in linear codes over a finite field. It is an interesting problem to find an analog of the theorem for Z4-codes. In a previous paper, the author gave a candidate of the theorem. The purpose of this paper is to give an improvement of the theorem. It is known that the lifted Golay code over Z4 contains 5-designs on Lee compositions. The improved method can find some of those without computational difficulty and without the help of a computer.