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

dc.contributor	Universidade Estadual Paulista (Unesp)
dc.date.accessioned	2015-04-27T11:56:07Z
dc.date.available	2015-04-27T11:56:07Z
dc.date.created	2015-04-27T11:56:07Z
dc.date.issued	2012
dc.identifier	Discrete Mathematics, Algorithms and Applications, v. 4, n. 4, p. 01-14, 2012.
dc.identifier	1793-8309
dc.identifier	http://hdl.handle.net/11449/122877
dc.identifier	10.1142/S1793830912500590
dc.identifier	8940498347481982
dc.description.abstract	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.
dc.language	eng
dc.relation	Discrete Mathematics, Algorithms and Applications
dc.rights	Acesso restrito
dc.source	Currículo Lattes
dc.subject	Monoid ring
dc.subject	cyclic code
dc.subject	BCH code
dc.subject	alternant code
dc.subject	Goppa code
dc.subject	Srivastava code AMSC: 11T71, 94A15, 14G50
dc.title	Cyclic codes through B[X;(a/b)Z_0, with (a/b) in Q^{+} and b=a+1, and Encoding
dc.type	Artículos de revistas