Encoding through generalized polynomial codes
This paper introduces novel constructions of cyclic codes using semigroup rings instead of polynomial rings. These constructions are applied to define and investigate the BCH, alternant, Goppa, and Srivastava codes. This makes it possible to improve several recent results due to Andrade and Palazzo...
| Authors: | , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2011 |
| Country: | Brasil |
| Institution: | Universidade Estadual Paulista (UNESP) |
| Repository: | Repositório Institucional da UNESP |
| Language: | English |
| OAI Identifier: | oai:repositorio.unesp.br:11449/72619 |
| Online Access: | http://dx.doi.org/10.1590/S1807-03022011000200006 http://hdl.handle.net/11449/72619 |
| Access Level: | Open access |
| Keyword: | Alternant code BCH code Cyclic code Goppa code Semigroup ring Srivastava code |
| Summary: | This paper introduces novel constructions of cyclic codes using semigroup rings instead of polynomial rings. These constructions are applied to define and investigate the BCH, alternant, Goppa, and Srivastava codes. This makes it possible to improve several recent results due to Andrade and Palazzo [1]. © 2011 SBMAC. |
|---|