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.