On decoding hyperbolic codes (Q6996930)

The article under review studies the performance of several list-decoding algorithms for hyperbolic codes. Hyperbolic codes are defined as the monomial evaluation codes with maximum dimension with respect to a fixed value for the footprint bound. To every hyperbolic code one can associate the smallest Reed-Muller (RM) code containing it, and the largest RM code contained in it. The authors propose decoding algorithms for hyperbolic codes using these RM codes. Other alternatives include a decoder based on the tensor product of Reed-Solomon codes, as well as an adaptation of a generalization of Sudan's list decoding algorithm for hyperbolic codes.\N\NThe performance of these algorithms is analysed in terms of the number of calls required to other known decoding algorithms and their error-correction capability, showing that each approach provides a different trade-off between computational complexity and error-correction capability.\N\NFor the entire collection see [Zbl 1559.11005].