Encoding through generalized polynomial codes

dc.contributorUniversidade Estadual Paulista (UNESP)
dc.creatorShah, T.
dc.creatorKhan, A.
dc.creatorAndrade, A. A.
dc.date2014-05-27T11:25:58Z
dc.date2016-10-25T18:34:21Z
dc.date2014-05-27T11:25:58Z
dc.date2016-10-25T18:34:21Z
dc.date2011-08-31
dc.date.accessioned2017-04-06T01:51:57Z
dc.date.available2017-04-06T01:51:57Z
dc.identifierComputational and Applied Mathematics, v. 30, n. 2, p. 349-366, 2011.
dc.identifier0101-8205
dc.identifier1807-0302
dc.identifierhttp://hdl.handle.net/11449/72619
dc.identifierhttp://acervodigital.unesp.br/handle/11449/72619
dc.identifier10.1590/S1807-03022011000200006
dc.identifierS1807-03022011000200006
dc.identifierWOS:000293652300006
dc.identifier2-s2.0-80051788111.pdf
dc.identifier2-s2.0-80051788111
dc.identifierhttp://dx.doi.org/10.1590/S1807-03022011000200006
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/893474
dc.descriptionThis 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.
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.languageeng
dc.relationComputational and Applied Mathematics
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectAlternant code
dc.subjectBCH code
dc.subjectCyclic code
dc.subjectGoppa code
dc.subjectSemigroup ring
dc.subjectSrivastava code
dc.titleEncoding through generalized polynomial codes
dc.typeOtro


Este ítem pertenece a la siguiente institución