Automorphism of Cyclic Codes英文文献资料.docVIP

Intelligent Information Management, 2012, 4, 309-310 /10.4236/iim.2012.425043 Published Online October 2012 (http://www.SciRP.org/journal/iim) Automorphism of Cyclic Codes Naser Amiri Department of Mathematices, Payame Noor University, Tehran, Iran Email: n_amiri@pnu.ac.ir Received July 24, 2012; revised August 27, 2012; accepted September 14, 2012 ABSTRACT We investigate how the code automorphism group can be used to study such combinatorial object as codes. Consider n n GF(q ) as a vector over GF(q). For any k = 0, 1, 2, 3, ···, n. Which GF(q ) exactly one subspace C of dimension k and which is invariant under the automorphism. Keywords: Code; Cyclic Code; Automorphism 1. Introduction a binary code and H be a subgroup of Aut(C). For a codeword ? ?C , the number of 1 in the coordinate place of v is the weight of v and denoted by wt?? ? . Usually Ni denotes the number of codewords in C of weight i and Ni(H) the number of codewords which are fixed by some element of H. Now, we will investigate a method of using the automorphism of group to find out the weight distribution of a given code C. There are many kind of automorphism group in mathe- matics. Among them such automorphism group as a code automorphism, (see [1-3]) design automorphism is im- portant to combinatories. These automorphism groups play a key role in determining the corresponding struc- ture, and provide a playground to study elementary alge- bra. In particular, code automorphism group is useful in determining the structure of codes, computing weight distribution, classifying codes, and devising decoding algorithm, and many kinds of code automorphism group algorithms. In this paper, we will investigate how the code automorphism g