By Topic

Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring

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

2 Author(s)
Ba-Zhong Shen ; Dept. of Electr. Eng. & Comput. Sci., Lehigh Univ., Bethlehem, PA, USA ; Tzeng, K.K.

A new algorithm is developed for decoding geometric Goppa codes (algebraic-geometric codes) up to their designed minimum distance. This algorithm is constructed on the basis of the one introduced by Porter, Shen, and Pellikaan (1992), but has improved it considerably in decoding capability by incorporating a majority voting scheme conceptually analogous to that employed by the algorithms of Feng and Rao (1993), and Duursma (1993). The algorithm is distinct from others in that its major steps are accomplished by solving a key equation in an affine ring. The result is a new algorithm with decoding capability on a par with that of Feng and Rao's and Duursma's algorithms. The new algorithm is applicable to a large class of geometric Goppa codes and thus provides a viable alternative to the algorithms of Feng and Rao, as well as Duursma for decoding geometric Goppa codes up to designed minimum distance

Published in:

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