Decoding of Berman Modular MDS Codes

A new algorithm is described for decoding of cyclic MDS codes with the parameters $(p,k,p-k+1)$, where $p$ is an arbitrary odd prime. The decoding is based on Berman's definition [Kibernetika, 1967, no. 1, pp. 31–39] of modular $p$-codes, as the MDS codes considered in this paper are a particular subclass of Berman's modular codes.