Encoding through generalized polynomial codes

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

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/72619

Title:

Encoding through generalized polynomial codes

Author(s):

Institution:

Quaid-i-Azam University
Universidade Estadual Paulista (UNESP)

ISSN:

0101-8205
1807-0302

Sponsorship:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Sponsorship Process Number:

FAPESP: 07/56052-8

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]. © 2011 SBMAC.

Issue Date:

31-Aug-2011

Citation:

Computational and Applied Mathematics, v. 30, n. 2, p. 349-366, 2011.

Time Duration:

349-366

Keywords:

Alternant code
BCH code
Cyclic code
Goppa code
Semigroup ring
Srivastava code

Source:

http://dx.doi.org/10.1590/S1807-03022011000200006

URI:

Access Rights:

Acesso aberto

Type:

outro

Source:

http://repositorio.unesp.br/handle/11449/72619

Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.

Show full item record View Statistics