Construction and decoding of BCH codes over finite commutative rings

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.date.accessioned2014-05-27T11:19:41Z
dc.date.available2014-05-27T11:19:41Z
dc.date.created2014-05-27T11:19:41Z
dc.date.issued1999-01-01
dc.identifierLinear Algebra and Its Applications, v. 286, n. 1-3, p. 69-85, 1999.
dc.identifier0024-3795
dc.identifierhttp://hdl.handle.net/11449/65680
dc.identifier10.1016/S0024-3795(98)10163-5
dc.identifierWOS:000077665300005
dc.identifier2-s2.0-0039627876
dc.identifier2-s2.0-0039627876.pdf
dc.identifier8940498347481982
dc.description.abstractBCH 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.
dc.languageeng
dc.relationLinear Algebra and Its Applications
dc.relation0.972
dc.relation0,994
dc.rightsAcesso aberto
dc.sourceScopus
dc.subjectBCH codes
dc.subjectError-location numbers
dc.subjectForney's method
dc.subjectGalois extension
dc.subjectModified Berlekamp-Massey algorithm
dc.subjectSyndrome calculation
dc.titleConstruction and decoding of BCH codes over finite commutative rings
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución