用Sakata算法译码最多4个错误的类双曲阿贝尔码
Decoding up to 4 errors in Hyperbolic-like Abelian Codes by the Sakata Algorithm
摘要：
我们处理两个问题与使用的Sakata的算法在一个特定的类的二元码。第一个是改进定位符解码的一般框架，以便将其应用于这类阿贝尔码。第二种方法是找到一组校正子表的索引，使得没有其他校正子有助于实现BMSa，而且，它们中的任何一个都可以被忽略\textit{a priori}。此外，这些索引的实现足以得到Groebner基;也就是说，它也是一个终止准则。
英文摘要：
We deal with two problems related with the use of the Sakata's algorithm in a specific class of bivariate codes. The first one is to improve the general framework of locator decoding in order to apply it on such abelian codes. The second one is to find a set of indexes oF the syndrome table such that no other syndrome contributes to implement the BMSa and, moreover, any of them may be ignored \textit{a priori}. In addition, the implementation on those indexes is sufficient to get the Groebner basis; that is, it is also a termination criterion.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
