Encoding through generalized polynomial codes

AUTOR(ES)
FONTE

Computational & Applied Mathematics

DATA DE PUBLICAÇÃO

2011

RESUMO

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].

Documentos Relacionados