Encoding through generalized polynomial codes

Artigo

Date

2011-08-31

Registration in:

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

0101-8205

1807-0302

http://hdl.handle.net/11449/72619

10.1590/S1807-03022011000200006

S1807-03022011000200006

WOS:000293652300006

2-s2.0-80051788111

2-s2.0-80051788111.pdf

8940498347481982

http://repositorioslatinoamericanos.uchile.cl/handle/2250/3921668

Author

Quaid-i-Azam University

Universidade Estadual Paulista (Unesp)

Institutions

Universidade Paulista Júlio de Mesquita Filho (Brasil)

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.

Subjects

Show full item record