Goppa codes through polynomials of B[X;(1/2^2)Z

Andrade, Antonio Aparecido de [UNESP]Shah, Tariq2015-04-272015-04-272011Journal of Advanced Research in Applied Mathematics, v. 3, n. 4, p. 12-20, 2011.1942-9649http://hdl.handle.net/11449/122686In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight $t\leq 2r$, i.e., whose minimum Hamming distance is $2^{2}r+1$.12-20engSemigroup ringsGoppa codesModified Berlekamp-Massey algorithmGoppa codes through polynomials of B[X;(1/2^2)Z_0] and its decoding principleArtigo10.5373/jaram.839.031611Acesso restrito8940498347481982