A class of skew-constacyclic codes over ℤ₄ + uℤ₄
by Amit Sharma; Maheshanand Bhaintwal
International Journal of Information and Coding Theory (IJICOT), Vol. 4, No. 4, 2017

Abstract: In this paper, we study a class of skew-constacyclic codes over R = ℤ₄ + uℤ₄, which is a non-chain extension of ℤ₄. 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 ℤ₄ have been found via this class, and the same have been added to the database of ℤ₄ codes.

Online publication date: Mon, 02-Oct-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Coding Theory (IJICOT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com