Abstract
Coding theory has so many important applications in cryptogram, communication technology and network security, etc. The MacWilliams type of identities for linear codes over rings are very important research object, becauce they are related to the computation of decoding error probability and error probability of undetectable codes. In this paper, we study linear codes over the ring <i>Z</i><sub>4</sub> + <i>uZ</i><sub>4</sub> with <i>u</i><sup>2</sup> = 0 . The Hermitian inner product over such ring is defined. New definitions for the complete weight enumerator, the symmetrical weight enumerator, the Lee weight enumerator and the Hamming weight enumerator of linear codes over the ring <i>Z</i><sup>4</sup> + <i>uZ</i><sub>4</sub> for the Hermitian inner product are given. The MacWilliams identities for these weight enumerators are studied.
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.
