De Andrade, Antonio Aparecido [UNESP]Palazzo Jr., Reginaldo2014-05-272014-05-271999-01-01Linear Algebra and Its Applications, v. 286, n. 1-3, p. 69-85, 1999.0024-3795http://hdl.handle.net/11449/65680BCH codes over arbitrary finite commutative rings with identity are derived in terms of their locator vector. The derivation is based on the factorization of xs -1 over the unit ring of an appropriate extension of the finite ring. We present an efficient decoding procedure, based on the modified Berlekamp-Massey algorithm, for these codes. The code construction and the decoding procedures are very similar to the BCH codes over finite integer rings. © 1999 Elsevier B.V. All rights reserved.69-85engBCH codesError-location numbersForney's methodGalois extensionModified Berlekamp-Massey algorithmSyndrome calculationArtigo10.1016/S0024-3795(98)10163-5WOS:000077665300005Acesso aberto2-s2.0-00396278762-s2.0-0039627876.pdf8940498347481982