Artigo
Cyclic codes through B[X;(a/b)Z_0, with (a/b) in Q^{+} and b=a+1, and Encoding
Registro en:
Discrete Mathematics, Algorithms and Applications, v. 4, n. 4, p. 01-14, 2012.
1793-8309
10.1142/S1793830912500590
8940498347481982
Autor
Shah, Tariq
Andrade, Antonio Aparecido de [UNESP]
Resumen
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. Universidade Estadual Paulista Júlio de Mesquita Filho, Instituto de Biociencias, Letras e Ciencias Exatas de Sao Jose do Rio Preto, Sao Jose do Rio Preto, RUA CRISTOVAO COLOMBO 2265 - DEPARTAMENTO DE MATEMATICA, JARDIM NAZARETH, CEP 15054-000, SP, Brasil Universidade Estadual Paulista Júlio de Mesquita Filho, Instituto de Biociencias, Letras e Ciencias Exatas de Sao Jose do Rio Preto, Sao Jose do Rio Preto, RUA CRISTOVAO COLOMBO 2265 - DEPARTAMENTO DE MATEMATICA, JARDIM NAZARETH, CEP 15054-000, SP, Brasil