Encoding through generalized polynomial codes
| Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
|---|---|
| Data(s) |
27/05/2014
27/05/2014
31/08/2011
|
| Resumo |
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Processo FAPESP: 07/56052-8 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. |
| Formato |
349-366 |
| Identificador |
http://dx.doi.org/10.1590/S1807-03022011000200006 Computational and Applied Mathematics, v. 30, n. 2, p. 349-366, 2011. 0101-8205 1807-0302 http://hdl.handle.net/11449/72619 10.1590/S1807-03022011000200006 S1807-03022011000200006 WOS:000293652300006 2-s2.0-80051788111 2-s2.0-80051788111.pdf |
| Idioma(s) |
eng |
| Relação |
Computational and Applied Mathematics |
| Direitos |
openAccess |
| Palavras-Chave | #Alternant code #BCH code #Cyclic code #Goppa code #Semigroup ring #Srivastava code |
| Tipo |
info:eu-repo/semantics/article |
