Hamming and Reed-Solomon codes over certain rings
Abstract
In 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.
How to cite this document
Andrade, A. A.; Palazzo, R.. Hamming and Reed-Solomon codes over certain rings. Computational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 20, n. 3, p. 289-306, 2001. Available at: <http://hdl.handle.net/11449/33690>.
Keywords
Language
English
Grant number
Collections
