Logotipo do repositório
 

Publicação:
Goppa and Srivastava codes over finite rings

dc.contributor.authorDe Andrade, Antonio Aparecido [UNESP]
dc.contributor.authorPalazzo, Reginaldo
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)
dc.contributor.institutionUniversidade Estadual de Campinas (UNICAMP)
dc.date.accessioned2022-04-29T07:26:35Z
dc.date.available2022-04-29T07:26:35Z
dc.date.issued2005-01-01
dc.description.abstractGoppa 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.en
dc.description.affiliationDepartment of Mathematics,Ibilce Unesp
dc.description.affiliationDepartment of Telematics,Feec Unicamp
dc.description.affiliationUnespDepartment of Mathematics,Ibilce Unesp
dc.format.extent231-244
dc.identifier.citationComputational and Applied Mathematics, v. 24, n. 2, p. 231-244, 2005.
dc.identifier.issn1807-0302
dc.identifier.issn2238-3603
dc.identifier.scopus2-s2.0-84949972766
dc.identifier.urihttp://hdl.handle.net/11449/228084
dc.language.isoeng
dc.relation.ispartofComputational and Applied Mathematics
dc.sourceScopus
dc.subjectGoppa code
dc.subjectSrivastava code
dc.titleGoppa and Srivastava codes over finite ringsen
dc.typeArtigo
dspace.entity.typePublication
unesp.campusUniversidade Estadual Paulista (UNESP), Instituto de Biociências, Letras e Ciências Exatas, São José do Rio Pretopt
unesp.departmentMatemática - IBILCEpt

Arquivos