Hamming and Reed-Solomon codes over certain rings
Loading...
Date
Authors
Advisor
Coadvisor
Graduate program
Undergraduate course
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Type
Article
Access right
Acesso aberto
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.
Description
Language
English
Citation
Computational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 20, n. 3, p. 289-306, 2001.
