Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Construction and decoding of BCH Codes over finite commutative rings
Author: de Andrade, AA
Palazzo, R
Abstract: 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 x(s)- 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. (C) 1999 Elsevier Science Inc. All rights reserved.
Subject: BCH codes
Galois extension
syndrome calculation
modified Berlekamp-Massey algorithm
error-location numbers
Forney's method
Country: EUA
Editor: Elsevier Science Inc
Rights: fechado
Identifier DOI: 10.1016/S0024-3795(98)10163-5
Date Issue: 1999
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOS000077665300005.pdf1.59 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.