Goppa codes over certain semigroups
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
27/04/2015
27/04/2015
2014
|
Resumo |
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. |
Formato |
65-71 |
Identificador |
http://www.diogenes.bg/ijam/contents/2014-27-1/7/ International Journal of Applied Mathematics, v. 27, n. 1, p. 65-71, 2014. 1311-1728 http://hdl.handle.net/11449/122689 http://dx.doi.org/10.12732/ijam.v27i1.7 8940498347481982 |
Idioma(s) |
eng |
Relação |
International Journal of Applied Mathematics |
Direitos |
openAccess |
Palavras-Chave | #Goppa code #Semigroup ring |
Tipo |
info:eu-repo/semantics/article |