Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||On The Decoding Of Reed-solomon And Bch Codes Over Integer Residue Rings|
Palazzo Jr. R.
|Abstract:||In this correspondence we present a decoding procedure for Reed-Solomon (RS) and BCH codes defined over an integer residue ring pgℤ q, where q is a power of a prime p. The proposed decoding procedure, as for RS and BCH codes over fields, consists of four major steps: 1) calculation of the syndromes; 2) calculation of the "elementary symmetric functions," by a modified Berlekamp-Massey algorithm for commutative rings; 3) calculation of the error location numbers; and 4) calculation of the error magnitudes. The proposed decoding procedure also applies to the synthesis of a shortest linear-feedback shift register (LFSR), capable of generating a prescribed finite sequence of elements lying in a commutative ring with identity. © 1997 IEEE.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.