Author's: Hua Liang and Yuan-Sheng Tang
Pages: [153] - [160]
Received Date: August 9, 2009
Submitted by:
By constructing a Gray map cyclic and cyclic codes over the ring
are studied. We prove that C is a
cyclic code of length n over R,
if and only if
is a quasi-cyclic code over
of index 2 and of length 4n. We also
prove that, if n is odd, then every binary code which is the
Gray image of a linear cyclic code of length n over R is
equivalent to a linear quasi-cyclic code over
of index 2 and length
cyclic code, constacyclic code, quasi-cyclic codes, Gray map, permutation.