Encoding through generalized polynomial codes

dc.contributorQuaid-i-Azam University
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-27T11:25:58Z
dc.date.available2014-05-27T11:25:58Z
dc.date.created2014-05-27T11:25:58Z
dc.date.issued2011-08-31
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.identifier10.1590/S1807-03022011000200006
dc.identifierS1807-03022011000200006
dc.identifierWOS:000293652300006
dc.identifier2-s2.0-80051788111
dc.identifier2-s2.0-80051788111.pdf
dc.identifier8940498347481982
dc.description.abstractThis 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.languageeng
dc.relationComputational and Applied Mathematics
dc.relation0.863
dc.relation0,272
dc.rightsAcesso aberto
dc.sourceScopus
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.typeArtículos de revistas


Este ítem pertenece a la siguiente institución