Abstract
In this work, linear codes over the ring S4 = F2 + uF2 + u2F2 + u3F2 are considered. The Lee weight and gray map for codes over S4 are defined and MacWilliams identities for the complete, the symmetrized and the Lee weight enumerators are obtained. Cyclic and (1 + u2)-constacyclic codes over S4 are studied, as a result of which a substantial number of optimal binary codes of different lengths are obtained as the Gray images of cyclic and constacyclic codes over S4.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.