A Note on Linear Codes over Semigroup Rings
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
27/04/2015
27/04/2015
2011
|
Resumo |
In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes through the semigroup ring B[X; 1 3Z0] instead of the polynomial ring B[X; Z0], where B is a finite commutative ring with identity, and for these constructions we improve the several results of [1]. After this, we present a decoding principle for BCH, alternant and Goppa codes which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight t ≤ r/2, i.e., whose minimum Hamming distance is r + 1. |
Formato |
79-89 |
Identificador |
TEMA. Tendências em Matemática Aplicada e Computacional, v. 12, n. 2, p. 79-89, 2011. 1677-1966 http://hdl.handle.net/11449/122690 http://dx.doi.org/10.5540/tema.2011.012.02.0079 8940498347481982 |
Idioma(s) |
eng |
Relação |
TEMA. Tendências em Matemática Aplicada e Computacional |
Direitos |
closedAccess |
Palavras-Chave | #Semigroup ring #BCH code #Alternant code #Goppa code #Srivastava code |
Tipo |
info:eu-repo/semantics/article |