Research ArticleOpen AccessGoogle Scholar indexed
Automorphism of Cyclic Codes
Department of Mathematices, Payame Noor University, Tehran, Iran
- 1 Department of Mathematices, Payame Noor University, Tehran, Iran
Intelligent Information Management·Volume 04 (2012)·Pages 309–310·Published 30 October 2012·DOI10.4236/iim.2012.425043
Copy link · social · email
Abstract
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.
KeywordsCodeCyclic CodeAutomorphism
- 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.
- 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.
- 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.