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.
| Authors: | , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2005 |
| Country: | Brasil |
| Institution: | Universidade Estadual Paulista (UNESP) |
| Repository: | Repositório Institucional da UNESP |
| Language: | English |
| OAI Identifier: | oai:repositorio.unesp.br:11449/228084 |
| Online Access: | http://hdl.handle.net/11449/228084 |
| Access Level: | Open access |
| Keyword: | Goppa code Srivastava code |
| Summary: | 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. |
|---|