Alternant and BCH codes over certain rings

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.date.accessioned2020-12-10T18:02:22Z
dc.date.accessioned2022-12-19T20:08:20Z
dc.date.available2020-12-10T18:02:22Z
dc.date.available2022-12-19T20:08:20Z
dc.date.created2020-12-10T18:02:22Z
dc.date.issued2003-01-01
dc.identifierComputational & Applied Mathematics. Heidelberg: Springer Heidelberg, v. 22, n. 2, p. 233-247, 2003.
dc.identifier2238-3603
dc.identifierhttp://hdl.handle.net/11449/195753
dc.identifierWOS:000208134800005
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5376391
dc.description.abstractAlternant 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.
dc.languageeng
dc.publisherSpringer
dc.relationComputational & Applied Mathematics
dc.sourceWeb of Science
dc.subjectcodes over rings
dc.subjectalternant codes
dc.subjectBCH codes
dc.subjectGalois extensions of local commutative rings
dc.subjectalgebraic decoding
dc.subjectmodified Berlekamp-Massey algorithm
dc.subjecterrors and erasures decoding
dc.subjectLee metric
dc.titleAlternant and BCH codes over certain rings
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución