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

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.

Interaction of cyclic and linear labaditin peptides with anionic and zwitterionic micelles

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Ultrasonography of the conceptus development from days 15 to 60 of pregnancy in non-cyclic recipient mares

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Interaction of cyclic and linear Labaditin peptides with anionic and zwitterionic micelles

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)