Hamming and Reed-Solomon codes over certain rings

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 code...

ver descrição completa

Detalhes bibliográficos
Autores: Andrade, A. A. [UNESP], Palazzo, R.
Tipo de documento: artigo
Estado:Versão publicada
Data de publicação:2001
País:Brasil
Recursos:Universidade Estadual Paulista (UNESP)
Repositório:Repositório Institucional da UNESP
Idioma:inglês
OAI Identifier:oai:repositorio.unesp.br:11449/33690
Acesso em linha:http://books.google.com.br/books?id=HkcEzM3QN9IC&lpg=PA265&hl=pt-BR&pg=PA265#v=onepage&q&f=false
http://hdl.handle.net/11449/33690
Access Level:Acceso aberto
Palavra-chave:Hamming code
Reed-Solomon code
modified Berlekamp-Massey algorithm
syndrome calculation
error-location number
Forney's method
Descrição
Resumo: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.