By Topic

General Error Locator Polynomials for Binary Cyclic Codes With t \le 2 and n < 63

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)
Emmanuela Orsini ; Dipt. di Matematica, Milan Univ. ; Massimiliano Sala

In this paper, we show that a recently proposed algorithm for decoding cyclic codes may be applied efficiently to all binary cyclic codes with tles2 and n<63. This is accomplished by providing structure theorems for the codes in this range and classifying the relevant cases

Published in:

IEEE Transactions on Information Theory  (Volume:53 ,  Issue: 3 )