Goppa and Srivastava codes over finite rings

作     者：de Andrade, Antonio Aparecido Palazzo, Reginaldo, Jr. 

作者机构：UNESP Ibilce Dept Math BR-15054000 Sao Jose Do Rio Preto SP Brazil Univ Estadual Campinas Feec Dept Telemat BR-13083852 Campinas SP Brazil 

出 版 物：《COMPUTATIONAL & APPLIED MATHEMATICS》 (Comput. Appl. Math.)

年 卷 期：2005年第24卷第2期

页      面：231-244页

核心收录：

基　　金：Fundacao de Amparo a Pesquisa do Estado de Sao Paulo - FAPESP [02/07473-7] Fundacao de Amparo a Pesquisa do Estado de Sao Paulo (FAPESP) [02/07473-7] Funding Source: FAPESP 

主　　题：Goppa code Srivastava code 

摘      要：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.