Goppa and Srivastava codes over finite rings

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.date.accessioned2020-12-10T18:02:29Z
dc.date.accessioned2022-12-19T20:08:23Z
dc.date.available2020-12-10T18:02:29Z
dc.date.available2022-12-19T20:08:23Z
dc.date.created2020-12-10T18:02:29Z
dc.date.issued2005-01-01
dc.identifierComputational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 24, n. 2, p. 231-244, 2005.
dc.identifier2238-3603
dc.identifierhttp://hdl.handle.net/11449/195757
dc.identifierWOS:000208135300005
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5376395
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.
dc.languageeng
dc.publisherSpringer
dc.relationComputational & Applied Mathematics
dc.sourceWeb of Science
dc.subjectGoppa code
dc.subjectSrivastava code
dc.titleGoppa and Srivastava codes over finite rings
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución