Goppa and Srivastava codes over finite rings
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.
| Autores: | , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2005 |
| 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/195757 |
| Acesso em linha: | http://hdl.handle.net/11449/195757 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Goppa code Srivastava code |
| 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. |
|---|