January 2015
·
18 Reads
·
1 Citation
JUSTC
In view of the factorization of (xⁿ - 1) in F2[x], the minimal generating set and rank of (1 + u)-constacyclic codes with an arbitrary length over the ring R= F2 + uF2 + u F2 were studied. A new Gray map from R to f2¹ was defined, the structures and generator polynomials of the Gray image of a linear (1 +u)-constacyclic code with an arbitrary length were determined, and some optimal binary linear cyclic codes were obtained.