Hamming and Reed-Solomon codes over certain rings

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.date.accessioned2014-05-20T15:22:46Z
dc.date.available2014-05-20T15:22:46Z
dc.date.created2014-05-20T15:22:46Z
dc.date.issued2001-01-01
dc.identifierComputational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 20, n. 3, p. 289-306, 2001.
dc.identifier1807-0302
dc.identifierhttp://hdl.handle.net/11449/33690
dc.identifierWOS:000208766400002
dc.identifier8940498347481982
dc.description.abstractIn 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.languageeng
dc.publisherSpringer
dc.relationComputational & Applied Mathematics
dc.rightsAcesso aberto
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