| Full text | |
| Author(s): |
Shah, Tariq
;
De Andrade, Antonio Aparecido
Total Authors: 2
|
| Document type: | Journal article |
| Source: | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS; v. 4, n. 4, p. 14-pg., 2012-12-01. |
| Abstract | |
Let B[X; S] be a monoid ring with any fixed finite unitary commutative ring B and a/b Z(0) 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 B[ X; a/b Z(0)]. For a = 1, almost all the results contained in [16] stands as a very particular case of this study. (AU) | |
| FAPESP's process: | 11/03441-2 - Codes and lattices with applications |
| Grantee: | Antonio Aparecido de Andrade |
| Support Opportunities: | Research Grants - Visiting Researcher Grant - International |