Decoding Linear Codes over Chain Rings Given by Parity Check Matrices

Abstract

We design a decoding algorithm for linear codes over finite chain rings given by their parity check matrices. It is assumed that decoding algorithms over the residue field are known at each degree of the adic decomposition.