Cyclic codes of length 2k over Z8.docVIP

Open Journal of Applied Sciences Supplement：2012 world Congress on Engineering and Technology Cyclic codes of length 2 over Z8 k Arpana Garg, Sucheta Dutt* Department of Applied Sciences PEC University of Technology, Sector - 12 Chandigarh. India arpana22_2005@ suchetapec@yahoo.co.in Abstract - We study the structure of cyclic codes of length 2k over Z for any natural number k. It is known that cyclic codes 1  Z [x]/ x  1  is a 2 2 8 2 1 , thereby implying that R is not a principal ideal ring. We also prove that k k k of length 2 over Z are ideals of the ring R= Z [x]/ x  . In this paper we prove that the ring R= 8 8 8 2 over Z are generated as ideals by at most three elements. local ring with unique maximal ideal M= ,x k cyclic codes of length 8 Keywords – Codes; Cyclic Codes; Ideal; Principal Ideal Ring. 1 2 2 1 k this paper we prove that the ring R= Z [x]/ x local ring with unique maximal ideal M= ,x Thereby implying that R is not a principal ideal ring (there exist cyclic codes which cannot be generated by one element).   is a . 8 1. Introduction Even the generators of a cyclic code need not divide x  1 Let R be a commutative finite ring with identity. A linear over Z . We also prove that cyclic codes of length Z are generated as ideals by at most three elements. 2 over n n code C over R of length n is defined as a R-submodule of R . k An element of C is called a codeword. A cyclic code C over R of length n is a linear code such that any cyclic shift of a codeword is also a codeword i.e. whenever (c ,c ,c ,...,c ) is in 8 8 Throughout this paper we assume that n = so that R = Z [x]/ 2 1 2 3 n C then so is (c ,c ,c ,...,c ). Cyclic codes of order n are ideals x 1. n 1 2 n-1 k n of the ring R . n 8 Let Z denote the ring of integers modulo 8. Cyclic codes over ring Z pm of length n such that. (n,p)