Algorithm for computing minimum distance

Luis Javier García Villalba, M.C. Rodríguez-Palánquex, F. Montoya-Vitini · Electronics Letters · 1999

A new class of curves, the so-called quasi-Hermitian curves, on q (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.

Read the paper · More papers on PaperTik