‎‎a natural generalization of two dimensional cyclic code ($t{tdc}$) is two dimensional skew cyclic code‎. ‎it is well-known that there is a correspondence between two dimensional skew cyclic codes and left ideals of the quotient ring $r_n:=f[x,y;rho,theta]/_l$‎. ‎in this paper we characterize the left ideals of the ring $r_n$ with two methods and find the generator matrix for two dimensional s...

‎‎A natural generalization of two dimensional cyclic code ($T{TDC}$) is two dimensional skew cyclic code‎. ‎It is well-known that there is a correspondence between two dimensional skew cyclic codes and left ideals of the quotient ring $R_n:=F[x,y;rho,theta]/_l$‎. ‎In this paper we characterize the left ideals of the ring $R_n$ with two methods and find the generator matrix for two dimensional s...

In this paper, we define and study quantum cyclic codes, a generalisation of cyclic codes to the quantum setting. Previously studied examples of quantum cyclic codes were all quantum codes obtained from classical cyclic codes via the CSS construction. However, the codes that we study are much more general. In particular, we construct cyclic stabiliser codes with parameters [[5, 1, 3]], [[17, 1,...

The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root cyclic codes and present a syndrome-based burst error decoding algorithm with guaranteed decoding radius based on an associated folded cyclic code. Furthermore...

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

We introduce an additive but not F4-linear map S from Fn4 to F 4 and exhibit some of its interesting structural properties. If C is a linear [n, k, d]4-code, then S(C) is an additive (2n, 2 , 2d)4-code. If C is an additive cyclic code then S(C) is an additive quasi-cyclic code of index 2. Moreover, if C is a module θ-cyclic code, a recently introduced type of code which will be explained below,...

A Z2Z4-additive code C ⊆ Z2 ×Zβ4 is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z2 and the set of Z4 coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant. These codes can be identified as submodules of the Z4[x]-module Z2[x]/(x− 1)×Z4[x]/(x − 1). The parameters of a Z2Z4-additive cyclic code are stated i...

Linear quasi-cyclic product codes over finite fields are investigated. Given the generating set in the form of a reduced Gröbner basis of a quasi-cyclic component code and the generator polynomial of a second cyclic component code, an explicit expression of the basis of the generating set of the quasicyclic product code is given. Furthermore, the reduced Gröbner basis of a one-level quasi-cycli...

Two skew cyclic codes can be equivalent for the Hamming metric only if they have the same length, and only the zero code is degenerate. The situation is completely different for the rank metric, where lengths of codes correspond to the number of outgoing links from the source when applying the code on a network. We study rank equivalences between skew cyclic codes of different lengths and, with...