Encoding through generalized polynomial codes

Detalhes bibliográficos
Autor(a) principal: Shah, T.
Data de Publicação: 2011
Outros Autores: Khan, A., Andrade, A. A. [UNESP]
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1590/S1807-03022011000200006
http://hdl.handle.net/11449/72619
Resumo: 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.
id UNSP_bcb2650f36ade6a9f30e2d698a5d95af
oai_identifier_str oai:repositorio.unesp.br:11449/72619
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Encoding through generalized polynomial codesAlternant codeBCH codeCyclic codeGoppa codeSemigroup ringSrivastava codeThis 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.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Department of Mathematics Quaid-i-Azam University, IslamabadDepartment of Mathematics Ibilce, Unesp, São José do Rio Preto, SPDepartment of Mathematics Ibilce, Unesp, São José do Rio Preto, SPFAPESP: 07/56052-8Quaid-i-Azam UniversityUniversidade Estadual Paulista (Unesp)Shah, T.Khan, A.Andrade, A. A. [UNESP]2014-05-27T11:25:58Z2014-05-27T11:25:58Z2011-08-31info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article349-366application/pdfhttp://dx.doi.org/10.1590/S1807-03022011000200006Computational and Applied Mathematics, v. 30, n. 2, p. 349-366, 2011.0101-82051807-0302http://hdl.handle.net/11449/7261910.1590/S1807-03022011000200006S1807-03022011000200006WOS:0002936523000062-s2.0-800517881112-s2.0-80051788111.pdf8940498347481982Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengComputational and Applied Mathematics0.8630,272info:eu-repo/semantics/openAccess2023-10-26T06:08:16Zoai:repositorio.unesp.br:11449/72619Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462023-10-26T06:08:16Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Encoding through generalized polynomial codes
title Encoding through generalized polynomial codes
spellingShingle Encoding through generalized polynomial codes
Shah, T.
Alternant code
BCH code
Cyclic code
Goppa code
Semigroup ring
Srivastava code
title_short Encoding through generalized polynomial codes
title_full Encoding through generalized polynomial codes
title_fullStr Encoding through generalized polynomial codes
title_full_unstemmed Encoding through generalized polynomial codes
title_sort Encoding through generalized polynomial codes
author Shah, T.
author_facet Shah, T.
Khan, A.
Andrade, A. A. [UNESP]
author_role author
author2 Khan, A.
Andrade, A. A. [UNESP]
author2_role author
author
dc.contributor.none.fl_str_mv Quaid-i-Azam University
Universidade Estadual Paulista (Unesp)
dc.contributor.author.fl_str_mv Shah, T.
Khan, A.
Andrade, A. A. [UNESP]
dc.subject.por.fl_str_mv Alternant code
BCH code
Cyclic code
Goppa code
Semigroup ring
Srivastava code
topic Alternant code
BCH code
Cyclic code
Goppa code
Semigroup ring
Srivastava code
description 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.
publishDate 2011
dc.date.none.fl_str_mv 2011-08-31
2014-05-27T11:25:58Z
2014-05-27T11:25:58Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv 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
8940498347481982
url http://dx.doi.org/10.1590/S1807-03022011000200006
http://hdl.handle.net/11449/72619
identifier_str_mv Computational and Applied Mathematics, v. 30, n. 2, p. 349-366, 2011.
0101-8205
1807-0302
10.1590/S1807-03022011000200006
S1807-03022011000200006
WOS:000293652300006
2-s2.0-80051788111
2-s2.0-80051788111.pdf
8940498347481982
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Computational and Applied Mathematics
0.863
0,272
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 349-366
application/pdf
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1803046168579538944