DocumentCode
2475183
Title
An algebraic characterization of q-ary images of qn-ary codes invariant under a permutation
Author
Woungang, Isaac ; Chao, Han-Chieh ; Denko, Mieso K. ; Huang, Fay
Author_Institution
Dept. of Comput. Sci., Ryerson Univ., Toronto, ON, Canada
fYear
2010
fDate
12-14 May 2010
Firstpage
335
Lastpage
339
Abstract
This paper introduces for the first time a characterization of the q-ary images of qn-ary σ-codes, i.e. linear codes of length m over Fqn that are invariant under the action of a permutation σ, in the special case when Fqn = Fq(β) = Fq(βl) for some l > 0, β ϵ Fqn. This is achieved by introducing an appropriate module structure on Fqnm.
Keywords
algebraic codes; computational complexity; linear codes; algebraic characterization; linear codes; q-ary images; qn-ary codes invariant; Chaotic communication; Computer science; Equations; Helium; Linear code;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (QBSC), 2010 25th Biennial Symposium on
Conference_Location
Kingston, ON
Print_ISBN
978-1-4244-5709-0
Type
conf
DOI
10.1109/BSC.2010.5472948
Filename
5472948
Link To Document