By Topic

The q-ary image of a qm-ary cyclic code

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
G. E. Seguin ; Dept. of Electr. & Comput. Eng., R. Mil. Coll. of Canada, Kingston, Ont., Canada

For (n, q)=1 V a qm-ary cyclic code of length n and with generator polynomial g(x), we show that there exists a basis for F(qm) over Fq with respect to which the q-ary image of V is cyclic, if and only if: (i) g(x) is over Fq; or (ii) g(x)=g0(x)(x-γ-q(μ)), g0(x) is over Fq, Fq≠F(qk)=Fq(γ)⊂F(qm ), μ an integer modulo k, and wm-γ has a divisor over F(qk) of degree e=m/k; or (iii) g(x)=g0 (x) Πμεs(x-γ(-qμ)), g 0(x) is over Fq, Fq≠F(qk)=Fq(γ)⊂F(qm ), S a set of integers module k of cardinality k-1 and wm -μ has a divisor over F(qk) of degree e=m/k. In all of the above cases, we determine all of the bases with respect to which the q-ary image of V is cyclic

Published in:

IEEE Transactions on Information Theory  (Volume:41 ,  Issue: 2 )