Goppa and Srivastava codes over finite rings
Autor(a) principal: | |
---|---|
Data de Publicação: | 2005 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://hdl.handle.net/11449/195757 |
Resumo: | Goppa and Srivastava codes over arbitrary local finite commutative rings with identity are constructed in terms of parity-cleck matrices. An efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, is proposed for Goppa codes. |
id |
UNSP_0804b12693f99f0060f94b4dacead8be |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/195757 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Goppa and Srivastava codes over finite ringsGoppa codeSrivastava codeGoppa and Srivastava codes over arbitrary local finite commutative rings with identity are constructed in terms of parity-cleck matrices. An efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, is proposed for Goppa codes.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)UNESP, Ibilce, Dept Math, BR-15054000 Sao Jose Do Rio Preto, SP, BrazilUniv Estadual Campinas, Feec, Dept Telemat, BR-13083852 Campinas, SP, BrazilUNESP, Ibilce, Dept Math, BR-15054000 Sao Jose Do Rio Preto, SP, BrazilFAPESP: 02/07473-7SpringerUniversidade Estadual Paulista (Unesp)Universidade Estadual de Campinas (UNICAMP)Andrade, Antonio Aparecido de [UNESP]Palazzo, Reginaldo2020-12-10T18:02:29Z2020-12-10T18:02:29Z2005-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article231-244Computational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 24, n. 2, p. 231-244, 2005.2238-3603http://hdl.handle.net/11449/195757WOS:000208135300005Web of Sciencereponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengComputational & Applied Mathematicsinfo:eu-repo/semantics/openAccess2021-10-23T11:51:47Zoai:repositorio.unesp.br:11449/195757Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T13:56:08.054267Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Goppa and Srivastava codes over finite rings |
title |
Goppa and Srivastava codes over finite rings |
spellingShingle |
Goppa and Srivastava codes over finite rings Andrade, Antonio Aparecido de [UNESP] Goppa code Srivastava code |
title_short |
Goppa and Srivastava codes over finite rings |
title_full |
Goppa and Srivastava codes over finite rings |
title_fullStr |
Goppa and Srivastava codes over finite rings |
title_full_unstemmed |
Goppa and Srivastava codes over finite rings |
title_sort |
Goppa and Srivastava codes over finite rings |
author |
Andrade, Antonio Aparecido de [UNESP] |
author_facet |
Andrade, Antonio Aparecido de [UNESP] Palazzo, Reginaldo |
author_role |
author |
author2 |
Palazzo, Reginaldo |
author2_role |
author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) Universidade Estadual de Campinas (UNICAMP) |
dc.contributor.author.fl_str_mv |
Andrade, Antonio Aparecido de [UNESP] Palazzo, Reginaldo |
dc.subject.por.fl_str_mv |
Goppa code Srivastava code |
topic |
Goppa code Srivastava code |
description |
Goppa and Srivastava codes over arbitrary local finite commutative rings with identity are constructed in terms of parity-cleck matrices. An efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, is proposed for Goppa codes. |
publishDate |
2005 |
dc.date.none.fl_str_mv |
2005-01-01 2020-12-10T18:02:29Z 2020-12-10T18:02:29Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
Computational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 24, n. 2, p. 231-244, 2005. 2238-3603 http://hdl.handle.net/11449/195757 WOS:000208135300005 |
identifier_str_mv |
Computational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 24, n. 2, p. 231-244, 2005. 2238-3603 WOS:000208135300005 |
url |
http://hdl.handle.net/11449/195757 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Computational & Applied Mathematics |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
231-244 |
dc.publisher.none.fl_str_mv |
Springer |
publisher.none.fl_str_mv |
Springer |
dc.source.none.fl_str_mv |
Web of Science reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808128218099613696 |