Decoding up to 4 errors in hyperbolic-like abelian codes by the Sakata algorithm (Q2232215)

This paper deals with two questions related with the use of the Sakata's algorithm in bivariate codes. Firstly, the authors give an improvement of the framework for applying the locator decoding algorithm in a class of abelian codes that it is called Hyperbolic-like abelian codes. Secondly, it is given a sufficient condition, provided that the number of errors is at most 4, to guarantee that the minimal set of polynomials (given by the algorithm) is exactly the Gröbner basis of the ideal of linear recurrence relations, and so, to get the defining set for the locator ideal. This condition is given in terms of the defining sets of these codes. For the entire collection see [Zbl 1470.11003].