Andrade, A. A. [UNESP]Interlando, J. C. [UNESP]Palazzo, R.2020-12-102020-12-102003-01-01Computational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 22, n. 2, p. 233-247, 2003.2238-3603http://hdl.handle.net/11449/195753Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms of parity-check matrices. The derivation is based on the factorization of x(s) - 1 over the unit group of an appropriate extension of the finite ring. An efficient decoding procedure which makes use of the modified Berlekamp-Massey algorithm to correct errors and erasures is presented. Furthermore, we address the construction of BCH codes over Z(m) under Lee metric.233-247engcodes over ringsalternant codesBCH codesGalois extensions of local commutative ringsalgebraic decodingmodified Berlekamp-Massey algorithmerrors and erasures decodingLee metricArtigoWOS:000208134800005