By Topic

A note on the q-ary image of a qm-ary repeated-root 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
$31 $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

3 Author(s)
Li-zhong Tang ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore ; Cheong Boon Soh ; Gunawan, E.

For (n,q)=ps, where p=ch(Fq), s⩾1, V a q m-ary repeated-root cyclic code of length n with generator polynomial g(x), we give a partial answer about whether the q-ary image of V is cyclic or not with respect to a certain basis for Fqm over Fq

Published in:

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