Publicação: Construction and decoding of BCH codes over finite commutative rings
Carregando...
Arquivos
Data
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Tipo
Artigo
Direito de acesso
Acesso aberto
Resumo
BCH 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.
Descrição
Palavras-chave
BCH codes, Error-location numbers, Forney's method, Galois extension, Modified Berlekamp-Massey algorithm, Syndrome calculation
Idioma
Inglês
Como citar
Linear Algebra and Its Applications, v. 286, n. 1-3, p. 69-85, 1999.
