Cyclic codes through B[X;(a/b)Z_0, with (a/b) in Q^{+} and b=a+1, and Encoding
Nenhuma Miniatura disponível
Data
2012
Autores
Shah, Tariq
Andrade, Antonio Aparecido de [UNESP]
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
Let B[X; S] be a monoid ring with any fixed finite unitary commutative ring B and is the monoid S such that b = a + 1, where a is any positive integer. In this paper we constructed cyclic codes, BCH codes, alternant codes, Goppa codes, Srivastava codes through monoid ring . For a = 1, almost all the results contained in [16] stands as a very particular case of this study.
Descrição
Palavras-chave
Monoid ring, cyclic code, BCH code, alternant code, Goppa code, Srivastava code AMSC: 11T71, 94A15, 14G50
Como citar
Discrete Mathematics, Algorithms and Applications, v. 4, n. 4, p. 01-14, 2012.