Quantum MDS and synchronizable codes from cyclic codes of length $$5p^s$$ over $$\mathbb F_{p^m}$$

2021 ◽  
Author(s):  
Hai Q. Dinh ◽  
Bac T. Nguyen ◽  
Roengchai Tansuchat
Keyword(s):  
Cyclic Codes

A Large Class of p-Ary Cyclic Codes and Sequence Families

2010 ◽  
Vol E93-A (11) ◽  
pp. 2272-2277
Author(s):  
Zhengchun ZHOU ◽  
Xiaohu TANG ◽  
Udaya PARAMPALLI
Keyword(s):  
Large Class ◽  
Cyclic Codes

A Family of q-Ary Cyclic Codes with Optimal Parameters

2020 ◽  
Vol E103.A (3) ◽  
pp. 631-633
Author(s):  
Wenhua ZHANG ◽  
Shidong ZHANG ◽  
Yong WANG ◽  
Jianpeng WANG
Keyword(s):  
Cyclic Codes ◽  
Optimal Parameters

A class of constacyclic codes over the ring Z4[u,v]/ and their Gray images

Filomat ◽  
2019 ◽  
Vol 33 (8) ◽  
pp. 2237-2248 ◽  
Author(s):  
Habibul Islam ◽  
Om Prakash
Keyword(s):  
Cyclic Codes ◽  
Constacyclic Codes ◽  
Gray Maps ◽  
Permutation Equivalent ◽  
Quasi Cyclic Codes

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.

Spatially Modulated Non Orthogonal Space Time Block Code: Construction and design from cyclic codes over Galois Field

2019 ◽  
Vol 35 ◽  
pp. 100735
Author(s):  
Godkhindi Shrutkirthi S. ◽  
Goutham Simha G.D. ◽  
U. Shripathi Acharya
Keyword(s):  
Cyclic Codes ◽  
Block Code ◽  
Galois Field ◽  
Space Time ◽  
Time Block ◽  
Code Construction ◽  
Space Time Block Code ◽  
Orthogonal Space

scholarly journals Monomial codes seen as invariant subspaces

2017 ◽  
Vol 15 (1) ◽  
pp. 1099-1107 ◽  
Author(s):  
María Isabel García-Planas ◽  
Maria Dolors Magret ◽  
Laurence Emilie Um
Keyword(s):  
Finite Field ◽  
Linear Algebra ◽  
Linear Transformation ◽  
Cyclic Codes ◽  
Invariant Subspaces ◽  
Hyperinvariant Subspaces ◽  
Computationally Expensive ◽  
The Relationship

Abstract It is well known that cyclic codes are very useful because of their applications, since they are not computationally expensive and encoding can be easily implemented. The relationship between cyclic codes and invariant subspaces is also well known. In this paper a generalization of this relationship is presented between monomial codes over a finite field 𝔽 and hyperinvariant subspaces of 𝔽n under an appropriate linear transformation. Using techniques of Linear Algebra it is possible to deduce certain properties for this particular type of codes, generalizing known results on cyclic codes.

On the generalized Hamming weights of cyclic codes

1997 ◽  
Vol 43 (1) ◽  
pp. 299-308 ◽  
Author(s):  
H. Janwa ◽  
A.K. Lal
Keyword(s):  
Cyclic Codes ◽  
Generalized Hamming Weights ◽  
Hamming Weights
Sign in / Sign up

Export Citation Format

Share Document