It is shown that the Berlekamp-Massey algorithm can be applied without exceptions to decode the class of binarygoppacodes with location set Gamma = {gamma(1), ..., gamma(n)} subset of or equal to GF(2(m)) and separa...
详细信息
It is shown that the Berlekamp-Massey algorithm can be applied without exceptions to decode the class of binarygoppacodes with location set Gamma = {gamma(1), ..., gamma(n)} subset of or equal to GF(2(m)) and separablegoppa polynomial G(z)= z(t) + z + beta defined over GF(2(m)) such that G(gamma(i)) not equal 0 for 1 less than or equal to i less than or equal to n, up to tile designed minimum distance 2t + 1.
暂无评论