Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer SciencesVol.E89-ANo.6pp.1863-1865 Publication Date: 2006/06/01 Online ISSN: 1745-1337 DOI: 10.1093/ietfec/e89-a.6.1863 Print ISSN: 0916-8508 Type of Manuscript: LETTER Category: Coding Theory Keyword: cyclic code, constacyclic code, quasi-cyclic code, Gray map,
Full Text: PDF(76.8KB)>>
Summary: A new Gray map between codes over F2+uF2+u2F2 and codes over F2 is defined. We prove that the Gray image of a linear (1-u2)-cyclic code over F2+uF2+u2F2 of length n is a binary distance invariant linear quasi-cyclic code. We also prove that, if n is odd, then every binary code which is the Gray image of a linear cyclic code over F2+uF2+u2F2 of length n is equivalent to a quasi-cyclic code.