Alternant and BCH codes over certain rings
Carregando...
Data
2003-01-01
Autores
Andrade, A.A. [UNESP]
Interlando, J.C. [UNESP]
Palazzo Jr., R.
Título da Revista
ISSN da Revista
Título de Volume
Editor
Sociedade Brasileira de Matemática Aplicada e Computacional
Resumo
Alternant 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.
Descrição
Palavras-chave
codes over rings, Alternant code, BCH codes, Galois extensions of local commutative rings, algebraic decoding, modified Berlekamp-Massey algorithm, errors and erasures decoding, Lee metric
Como citar
Computational & Applied Mathematics. Sociedade Brasileira de Matemática Aplicada e Computacional, v. 22, n. 2, p. 233-247, 2003.