By Topic

Some Results on Cyclic Codes Over {F}_{2}+v{F}_{2}

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

3 Author(s)
Shixin Zhu ; School of Mathematics, Hefei University of Technology, Hefei, China ; Yu Wang ; Minjia Shi

In this paper, we investigate the structure and properties of cyclic codes over the ring F 2+vF 2 . We first study the relationship between cyclic codes over F 2+vF 2 and binary cyclic codes. Then we prove that cyclic codes over the ring are principally generated, and give the generator polynomial of cyclic codes over the ring. Finally, we obtain the unique idempotent generators for cyclic codes of odd length and determine the number of cyclic codes for a given length n over F 2+vF 2.

Published in:

IEEE Transactions on Information Theory  (Volume:56 ,  Issue: 4 )