Abstract
In this paper, we study a class of skew-constacyclic codes over R = Z4 + uZ4, which is a non-chain extension of Z4. Some structural properties of R[x, θ] are discussed, where θ is an automorphism of R. We determine a necessary condition and a sufficient condition for these codes to be free, when they are principally generated. A Gray map over R is defined and some good codes are obtained using it. For even n, a relation between the generator polynomial of a code and that of its dual is obtained. Some examples are given to illustrate the results. Further, we have generalised these codes to double skew-constacyclic codes over R. Some good codes with improved minimum Lee distance over Z4 have been found via this class, and the same have been added to the database of Z4 codes.
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 callMore From: International Journal of Information and Coding Theory
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.
