Andrade, A. A. [UNESP]Palazzo, R.2014-05-202014-05-202001-01-01Computational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 20, n. 3, p. 289-306, 2001.1807-0302http://hdl.handle.net/11449/33690In 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.289-306engHamming codeReed-Solomon codemodified Berlekamp-Massey algorithmsyndrome calculationerror-location numberForney's methodArtigoWOS:000208766400002Acesso aberto8940498347481982