On Linear Complexity and Schaub Bound for Cyclic Codes by Defining Sequence with Unknown Elements

Author(s):  
J. ZHENG
Author(s):  
Zhengchun ZHOU ◽  
Xiaohu TANG ◽  
Udaya PARAMPALLI
Keyword(s):  

Author(s):  
Wenhua ZHANG ◽  
Shidong ZHANG ◽  
Yong WANG ◽  
Jianpeng WANG

Filomat ◽  
2019 ◽  
Vol 33 (8) ◽  
pp. 2237-2248 ◽  
Author(s):  
Habibul Islam ◽  
Om Prakash

In this paper, we study (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes over the ring Z4 + uZ4 + vZ4 + uvZ4 where u2 = v2 = 0,uv = vu. We define some new Gray maps and show that the Gray images of (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes are cyclic, quasi-cyclic and permutation equivalent to quasi-cyclic codes over Z4. Further, we determine the structure of (1 + 2u + 2v)-constacyclic codes of odd length n.


Sign in / Sign up

Export Citation Format

Share Document