ℤ2ℤ4-Additive Cyclic Codes: Kernel and Rank

A Z2Z4-additive code C ⊆ Z α 2 ×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. Let Φ(C) be the binary Gray image of C. We study the rank and the dimension of the kernel of a Z2Z4-additive cyclic code C, that is, the dimensions of the binary linear codes 〈Φ(C)〉 and ker(Φ(C)). We give upper and lower bounds for these parameters. It is known that the codes 〈Φ(C)〉 and ker(Φ(C)) are binary images of Z2Z4-additive codes R(C) and K(C), respectively. Moreover, we show that R(C) and K(C) are also cyclic and we determine the generator polynomials of these codes in terms of the generator polynomials of the code C.