Artigo
Goppa and Srivastava codes over finite rings
Fecha
2005-08-01Registro en:
Computational & Applied Mathematics. Sociedade Brasileira de Matemática Aplicada e Computacional, v. 24, n. 2, p. 231-244, 2005.
1807-0302
10.1590/S0101-82052005000200005
S1807-03022005000200005
S1807-03022005000200005.pdf
8940498347481982
Autor
Universidade Estadual Paulista (Unesp)
Universidade Estadual de Campinas (UNICAMP)
Resumen
Goppa and Srivastava codes over arbitrary local finite commutative rings with identity are constructed in terms of parity-cleck matrices. An efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, is proposed for Goppa codes.