We give a new algorithm for the solution of the Hamming metricdecoding problem for alternant codes over a Galois ring R. First wedevelop a comprehensive theory of Grobner bases overR|x1,...,xn|, which is of independent interest. Byspecialising to the case of one variable, we show that the solution ofthe key equation can be determined as a certain minimal element in aGrobner basis of the solution module
展开▼
机译：我们为汉明度量提供了一种新的算法
在Galois环R中的交替代码解码问题。首先我们
发展Grobner基地的全面理论
r | x 1 ，...，x n |，它是独立的兴趣。经过
专门从事一个变量的情况，我们展示了解决方案
关键等式可以被确定为a中的某个最小元素
Grobner对解决方案模块的基础
展开▼
