Encoding through generalized polynomial codes
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].
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Sociedade Brasileira de Matemática Aplicada e Computacional
2011
|
| Online Access: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022011000200006 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|