论文信息 - Modified Berlekamp-Massey algorithm for decoding BCH codes defined over rings

Modified Berlekamp-Massey algorithm for decoding BCH codes defined over rings

We propose an extension of the Berlekamp-Massey (1969) algorithm for decoding BCH codes defined over integer residue rings and for synthesizing the shortest linear feedback shift register (LFSR) that will generate a given finite sequence of elements lying also in an integer residue ring.<<ETX>>

Reginaldo Palazzo | J. C. Interlando

[1] N. J. A. Sloane,et al. Shift-Register Synthesis (Modulo m) , 1985, SIAM J. Comput..

[2] Ian F. Blake. Codes over Integer Residue Rings , 1975, Inf. Control..

[3] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[4] Priti Shankar. On BCH codes over arbitrary integer tings (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[5] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .

[6] P Shankar. On BCH codes over arbitrary integer rings , 1979 .