The structure of ℤ2ℤ2s-additive cyclic codes.

ℤ 2 ℤ 2 s -additive codes for any integer s > 1 are considered as codes over mixed alphabets. They are a generalization of binary linear codes and linear codes over ℤ 2 s . In this paper, we are interested in studying ℤ 2 ℤ 2 s -additive cyclic codes. We will give the generator polynomials of these codes. We will also give the minimal spanning sets for these codes. We will define separable ℤ 2 ℤ 2 s -additive codes and provide conditions on the generator polynomials for a ℤ 2 ℤ 2 s -additive cyclic code to be separable. Finally, we present some examples of optimal parameter binary codes obtained as images of ℤ 2 ℤ 8 -additive cyclic codes. [ABSTRACT FROM AUTHOR]