Title :
Cyclic Codes over Finite Rings
Author_Institution :
Coll. of Sci., Anhui Univ. of Sci. & Technol., Huainan, China
Abstract :
A new Gray map between codes over finite rings R = F2 + uF2 + u2F2 and codes over F2 is defined. We prove that the Gray image of a linear (1+u+u2)-cyclic code over R of length n is a binary distance invariant linear 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 R of length n is equivalent to a cyclic code.
Keywords :
Gray codes; binary codes; cyclic codes; linear codes; Gray map; binary distance invariant linear cyclic code; finite ring; linear Gray image; Binary codes; Educational institutions; Lattices; Linear code; Polynomials;
Conference_Titel :
Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-6250-6
DOI :
10.1109/wicom.2011.6040189
