Goppa codes through polynomials of B[X;(1/2^2)Z_0] and its decoding principle
Nenhuma Miniatura disponível
Data
2011
Autores
Andrade, Antonio Aparecido de [UNESP]
Shah, Tariq
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
In 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$.
Descrição
Palavras-chave
Semigroup rings, Goppa codes, Modified Berlekamp-Massey algorithm
Como citar
Journal of Advanced Research in Applied Mathematics, v. 3, n. 4, p. 12-20, 2011.