Alternant and BCH codes over certain rings

dc.creatorAndrade, A.A.
dc.creatorInterlando, J.C.
dc.creatorPalazzo Jr., R.
dc.date2003-01-01
dc.date2014-07-18T20:03:54Z
dc.date2015-11-26T11:39:44Z
dc.date2014-07-18T20:03:54Z
dc.date2015-11-26T11:39:44Z
dc.date.accessioned2018-03-28T20:43:08Z
dc.date.available2018-03-28T20:43:08Z
dc.identifierComputational & Applied Mathematics. Sociedade Brasileira de Matemática Aplicada e Computacional, v. 22, n. 2, p. 233-247, 2003.
dc.identifier1807-0302
dc.identifierS1807-03022003000200005
dc.identifier10.1590/S0101-82052003000200005
dc.identifierhttp://dx.doi.org/10.1590/S0101-82052003000200005
dc.identifierhttp://www.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022003000200005
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/38618
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/38618
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1234289
dc.descriptionAlternant 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 Zm under Lee metric.
dc.description233
dc.description247
dc.languageen
dc.publisherSociedade Brasileira de Matemática Aplicada e Computacional
dc.relationComputational & Applied Mathematics
dc.rightsaberto
dc.sourceSciELO
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