Title: On the decoding of Reed-Solomon and BCH codes over integer residue rings
Abstract:We present a decoding procedure for Reed-Solomon (RS) and BCH codes defined over an integer residue ring pgZ/sub q/, where q is a power of a prime p. The proposed decoding procedure, as for RS and BCH...We present a decoding procedure for Reed-Solomon (RS) and BCH codes defined over an integer residue ring pgZ/sub 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 (1968, 1969) 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.Read More
Publication Year: 1997
Publication Date: 1997-05-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 50
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot