We study the problem of finding those missing syndrome values that are needed to implment the Berlekamp-Massey-Sakata algorithm as the Feng-Rao Majority Voting for algebraic geometric codes. We apply our results to solve syndrome correction in abelian codes.

翻译：本文研究了在将Berlekamp-Massey-Sakata算法作为代数几何码的Feng-Rao多数投票译码实现时，寻找所需缺失伴随式值的问题。我们将所得结果应用于解决阿贝尔码中的伴随式校正问题。