Goppa and Srivastava codes over finite rings
Loading...
Date
Advisor
Coadvisor
Graduate program
Undergraduate course
Journal Title
Journal ISSN
Volume Title
Publisher
Type
Article
Access right
Abstract
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.
Description
Keywords
Language
English
Citation
Computational and Applied Mathematics, v. 24, n. 2, p. 231-244, 2005.
Related itens
Sponsors
Other forms of access
