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...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| País: | Brasil |
| Institución: | Universidade Estadual Paulista (UNESP) |
| Repositorio: | Repositório Institucional da UNESP |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.unesp.br:11449/72619 |
| Acceso en línea: | http://dx.doi.org/10.1590/S1807-03022011000200006 http://hdl.handle.net/11449/72619 |
| Access Level: | acceso abierto |
| Palabra clave: | Alternant code BCH code Cyclic code Goppa code Semigroup ring Srivastava code |
| Sumario: | 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. |
|---|