Otro
Goppa codes over certain semigroups
Registro en:
International Journal of Applied Mathematics, v. 27, n. 1, p. 65-71, 2014.
1311-1728
8940498347481982
Autor
Andrade, Antonio Aparecido de
Shah, Tariq
Azam, Naveed Ahmed
Hussain, Syed Azmat
Resumen
A Goppa code is described in terms of a polynomial, known as Goppa polynomial, and in contrast to cyclic codes, where it is difficult to estimate the minimum Hamming distance d from the generator polynomial. Furthermore, a Goppa code has the property that d ≥ deg(h(X))+1, where h(X) is a Goppa polynomial. In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm.