Encoding through generalized polynomial codes
| Autor: | Tariq Shah, Antonio Aparecido de Andrade, Atlas Khan |
|---|---|
| Přispěvatelé: | Quaid-i-Azam University, Universidade Estadual Paulista (Unesp) |
| Rok vydání: | 2011 |
| Předmět: |
Discrete mathematics
BCH code Polynomial code Semigroup Applied Mathematics Polynomial ring semigroup ring Goppa code Srivastava code cyclic code Linear code Combinatorics Computational Mathematics Reed–Solomon error correction Cyclic code alternant code Computer Science::Information Theory Mathematics |
| Zdroj: | Computational & Applied Mathematics, Volume: 30, Issue: 2, Pages: 349-366, Published: 2011 Scopus Repositório Institucional da UNESP Universidade Estadual Paulista (UNESP) instacron:UNESP Computational & Applied Mathematics v.30 n.2 2011 Computational & Applied Mathematics Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC) instacron:SBMAC |
| ISSN: | 1807-0302 |
| DOI: | 10.1590/s1807-03022011000200006 |
| Popis: | Submitted by Vitor Silverio Rodrigues (vitorsrodrigues@reitoria.unesp.br) on 2014-05-27T11:25:58Z No. of bitstreams: 0Bitstream added on 2014-05-27T14:47:19Z : No. of bitstreams: 1 2-s2.0-80051788111.pdf: 196564 bytes, checksum: 74c42aa5547e69f679a34fed182e99a2 (MD5) Made available in DSpace on 2014-05-27T11:25:58Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-08-31 Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) 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. Department of Mathematics Quaid-i-Azam University, Islamabad Department of Mathematics Ibilce, Unesp, São José do Rio Preto, SP Department of Mathematics Ibilce, Unesp, São José do Rio Preto, SP FAPESP: 07/56052-8 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|