Cyclic codes through B[X;(a/b)Z_0, with (a/b) in Q^{+} and b=a+1, and Encoding
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
27/04/2015
27/04/2015
2012
|
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. |
Formato |
01-14 |
Identificador |
http://www.worldscientific.com/doi/abs/10.1142/S1793830912500590 Discrete Mathematics, Algorithms and Applications, v. 4, n. 4, p. 01-14, 2012. 1793-8309 http://hdl.handle.net/11449/122877 http://dx.doi.org/10.1142/S1793830912500590 8940498347481982 |
Idioma(s) |
eng |
Relação |
Discrete Mathematics, Algorithms and Applications |
Direitos |
closedAccess |
Palavras-Chave | #Monoid ring #cyclic code #BCH code #alternant code #Goppa code #Srivastava code AMSC: 11T71, 94A15, 14G50 |
Tipo |
info:eu-repo/semantics/article |