In the present study, we define cyclic codes over the commutative principal ideal ring F2 ? (F2 + vF2) with v2 = v and obtain some results on cyclic codes over F2 ? (F2 + vF2). We also investigate the dual of a cyclic code over F2 ? (F2 + vF2) depending on two inner products. We determine a generator polynomial of cyclic codes and give the calculation of the number of cyclic codes over F2 ? (F2 + vF2). Furthermore, we show that the Gray images of a cyclic code over F2 ? (F2 + vF2) of length n are binary quasi-cyclic codes of length 3n and of index 3. We find numerous binary codes as Gray images of cyclic codes over F2 ? (F2 + vF2) and tabulate the optimal ones. Moreover, we show that it is possible to obtain binary quantum error-correcting codes (QECCs) from cyclic codes over F2 ? (F2 + vF2).
We introduce a Gray map from
F2m+uF2m to
F22m and study
(1+u)-constacyclic codes over
F2m+uF2m, where
u2=0. It is proved that the image of a
(1+u)-constacyclic code length
n over
F2m+uF2m under the Gray map is a distance-invariant quasi-cyclic code of index
m and length
2mn over
F2. We also prove that every code of length
2mn which is the Gray image of cyclic codes over
F2m+uF2m of length
n is permutation equivalent to a binary quasi-cyclic code of index
m. Furthermore, a family of quantum error-correcting codes obtained from the Calderbank-Shor-Steane (CSS) construction applied to
(1+u)-constacyclic codes over
F2m+uF2m.