De Andrade, Antonio Aparecido [UNESP]Palazzo, Reginaldo2022-04-292022-04-292005-01-01Computational and Applied Mathematics, v. 24, n. 2, p. 231-244, 2005.1807-03022238-3603http://hdl.handle.net/11449/228084Goppa 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.231-244engGoppa codeSrivastava codeArtigo2-s2.0-84949972766