A Note on Linear Codes over Semigroup Rings

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorQuaid-i-Azam University
dc.date.accessioned2015-04-27T11:55:57Z
dc.date.available2015-04-27T11:55:57Z
dc.date.created2015-04-27T11:55:57Z
dc.date.issued2011
dc.identifierTEMA. Tendências em Matemática Aplicada e Computacional, v. 12, n. 2, p. 79-89, 2011.
dc.identifier1677-1966
dc.identifierhttp://hdl.handle.net/11449/122690
dc.identifier10.5540/tema.2011.012.02.0079
dc.identifier8940498347481982
dc.description.abstractIn this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes through the semigroup ring B[X; 1 3Z0] instead of the polynomial ring B[X; Z0], where B is a finite commutative ring with identity, and for these constructions we improve the several results of [1]. After this, we present a decoding principle for BCH, alternant and Goppa codes which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight t ≤ r/2, i.e., whose minimum Hamming distance is r + 1.
dc.languageeng
dc.relationTEMA. Tendências em Matemática Aplicada e Computacional
dc.rightsAcesso restrito
dc.sourceCurrículo Lattes
dc.subjectSemigroup ring
dc.subjectBCH code
dc.subjectAlternant code
dc.subjectGoppa code
dc.subjectSrivastava code
dc.titleA Note on Linear Codes over Semigroup Rings
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución