Hamming and Reed-Solomon codes over certain rings

dc.creatorAndrade, AA
dc.creatorPalazzo, R
dc.date2001
dc.date2014-07-30T17:52:41Z
dc.date2015-11-26T17:38:13Z
dc.date2014-07-30T17:52:41Z
dc.date2015-11-26T17:38:13Z
dc.date.accessioned2018-03-29T00:19:48Z
dc.date.available2018-03-29T00:19:48Z
dc.identifierComputational & Applied Mathematics. Springer Heidelberg, v. 20, n. 3, n. 289, n. 306, 2001.
dc.identifier1807-0302
dc.identifierWOS:000208766400002
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/68565
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/68565
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1286138
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionIn this work we present extensions of constructions of Hamming and Reed-Solomon codes over local finite commutative rings with identity obtained from algebraic integer rings of a number field. Also, we present efficient decoding procedures for these codes. The decoding procedure of Reed-Solomon codes is based on the modified Berlekamp-Massey algorithm.
dc.description20
dc.description3
dc.description289
dc.description306
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionFAPESP [95/4720-8]
dc.languageen
dc.publisherSpringer Heidelberg
dc.publisherHeidelberg
dc.publisherAlemanha
dc.relationComputational & Applied Mathematics
dc.relationComput. Appl. Math.
dc.rightsaberto
dc.rightshttp://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0
dc.sourceWeb of Science
dc.subjectHamming code
dc.subjectReed-Solomon code
dc.subjectmodified Berlekamp-Massey algorithm
dc.subjectsyndrome calculation
dc.subjecterror-location number
dc.subjectForney's method
dc.titleHamming and Reed-Solomon codes over certain rings
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución