On Goppa and Srivastava codes over finite rings

Goppa and Srivastava have described interesting classes of linear noncyclic error-correcting codes over finite fields. In this work we present a construction technique of Goppa and Srivastava codes over local finite commutative rings with identity in terms of parity-check matrix and an efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, is proposed for the Goppa codes.