2025/10/02 by Silouanos Brazitikos, Brazitikos, Silouanos, Theodoulos Garefalakis +3
Social Sciences · #Delphi Technique in Research #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2510.01811
openalex publication_date 2025/10/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Polynomial evaluation codes hold a prominent place in coding theory. In this work, we study the problem of list decoding for a general class of polynomial evaluation codes, also known as Toric codes, that are defined for any given convex polytope P. Special cases, such as Reed-Solomon and Reed-Muller codes, have been studied extensively. We present a generalization of the Guruswami-Sudan algorithm that takes into account the geometry and the combinatorics of P and compute bounds for the decoding radius.