Hamming and Reed-Solomon codes over certain rings
| Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
|---|---|
| Data(s) |
20/05/2014
20/05/2014
01/01/2001
|
| Resumo |
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Processo FAPESP: 95/4720-8 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. |
| Formato |
289-306 |
| Identificador |
http://books.google.com.br/books?id=HkcEzM3QN9IC&lpg=PA265&hl=pt-BR&pg=PA265#v=onepage&q&f=false Computational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 20, n. 3, p. 289-306, 2001. 1807-0302 http://hdl.handle.net/11449/33690 WOS:000208766400002 |
| Idioma(s) |
eng |
| Publicador |
Springer |
| Relação |
Computational & Applied Mathematics |
| Direitos |
openAccess |
| Palavras-Chave | #Hamming code #Reed-Solomon code #modified Berlekamp-Massey algorithm #syndrome calculation #error-location number #Forney's method |
| Tipo |
info:eu-repo/semantics/article |
