Goppa and Srivastava codes over finite rings

AUTOR(ES)
FONTE

Computational & Applied Mathematics

DATA DE PUBLICAÇÃO

2005-08

RESUMO

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.

Documentos Relacionados