Cyclic codes through B[X;(a/b)Z_0, with (a/b) in Q^{+} and b=a+1, and Encoding

Shah, TariqAndrade, Antonio Aparecido de [UNESP]2015-04-272015-04-272012Discrete Mathematics, Algorithms and Applications, v. 4, n. 4, p. 01-14, 2012.1793-8309http://hdl.handle.net/11449/122877Let 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.01-14engMonoid ringcyclic codeBCH codealternant codeGoppa codeSrivastava code AMSC: 11T71, 94A15, 14G50Cyclic codes through B[X;(a/b)Z_0, with (a/b) in Q^{+} and b=a+1, and EncodingArtigo10.1142/S1793830912500590Acesso restrito8940498347481982