Encoding through generalized polynomial codes

T. Shah; A. Khan; A. A. Andrade

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from SciELO through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Encoding through generalized polynomial codes

Full text
Author(s):	T. Shah ^[1] ; A. Khan ^[1] ; A. A. Andrade ^[2] Total Authors: 3
Affiliation:	^[1] Quaid I Azam Univ, Dept Math, Islamabad - Pakistan ^[2] UNESP, Dept Math, Sao Jose Do Rio Preto, SP - Brazil Total Affiliations: 2
Document type:	Journal article
Source:	COMPUTATIONAL & APPLIED MATHEMATICS; v. 30, n. 2, p. 349-366, 2011-00-00.
Abstract
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]. (AU)

Short URL