Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
