By Topic

Algorithm for computing minimum distance

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 $33
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)
L. J. Garcia-Villalba ; Inst. de Fisica Aplicada, CSIC, Madrid, Spain ; M. C. Rodriguez-Palanquex ; F. Montoya-Vitini

A new class of curves, the so-called quasi-Hermitian curves, on Fq (with q=2j) are presented. An algorithm which enables the exact minimum distance for the corresponding Goppa codes to be determined is also presented. This work leads to the possibility of constructing new versions of such codes

Published in:

Electronics Letters  (Volume:35 ,  Issue: 18 )