IIM  Vol.4 No.5 A , October 2012
Automorphism of Cyclic Codes
Author(s) Naser Amiri*
We investigate how the code automorphism group can be used to study such combinatorial object as codes. Consider GF(qn) as a vector over GF(q). For any k = 0, 1, 2, 3, ???, n. Which GF(qn) exactly one subspace C of dimension k and which is invariant under the automorphism.

Cite this paper
N. Amiri, "Automorphism of Cyclic Codes," Intelligent Information Management, Vol. 4 No. 5, 2012, pp. 309-310. doi: 10.4236/iim.2012.425043.
[1]   A. A. Andrad and R. Palazzo Jr., “Constraction and De-coding of BCH Codes over Finite Commutative Ring,” Linear Algebra and Its Applications, Vol. 286, 1999, pp. 69-85.

[2]   A. A. Andrad and R. Palazzo Jr., “On Coding Collineating Graphs Of Symmetric Block Design,” Journal of Combinatorial Theory, Vol. 11, No. 3, 1971, pp. 272-281.

[3]   R. C. Bose and D. K. Ray-Chaudhuri, “On a Class of Error-Correcting Binary Group Codes,” Information and Control, Vol. 3, No. 1, 1960, pp. 68-79.