A study of cyclic and constacyclic codes over Z4 + uZ4 + vZ4 Online publication date: Fri, 28-Sep-2018
by Habibul Islam; Om Prakash
International Journal of Information and Coding Theory (IJICOT), Vol. 5, No. 2, 2018
Abstract: In this paper, we study some properties of cyclic and constacyclic codes over the ring R = Z4 + uZ4 + vZ4 where u2 = uv = vu = 0. The generator polynomials and minimal spanning set for cyclic codes over R are determined. Further, (1 + 2u) - constacyclic codes are considered and find the cyclic, quasi-cyclic and permutation equivalent to a QC code over Z4 as the Gray images of (1 + 2u) - constacyclic codes over R.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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