By Topic

Decoding of cyclic codes over F2+uF2

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

2 Author(s)
P. Udaya ; Dept. of Math., R. Melbourne Inst. of Technol., Vic., Australia ; A. Bonnecaze

We give a simple decoding algorithm to decode linear cyclic codes of odd length over the ring R=F2+uF2={0,1,u,u¯=u+1}, where u2=0. A spectral representation of the cyclic codes over R is given and a BCH-like bound is given for the Lee distance of the codes. The ring R shares many properties of Z4 and F4 and admits a linear “Gray map”

Published in:

IEEE Transactions on Information Theory  (Volume:45 ,  Issue: 6 )