Kavli Affiliate: G. Ravichandran
| First 5 Authors: [#item_custom_name[1, [#item_custom_name[2, [#item_custom_name[3, [#item_custom_name[4, [#item_custom_name[5| Summary:In this article, we present a fast algorithm performing an instance of the Guruswami-Sudan list decoder for algebraic geometry codes. We show that any such code can be decoded in $tildeO(s^2ell^ω-1μ^ω-1(n+g) + ell^ωμ^ω)$ operations in the underlying finite field, where $n$ is the code length, $g$ is the genus of the function field used to construct the code, $s$ is the multiplicity parameter, $ell$ is the designed list size and $μ$ is the smallest positive element in the Weierstrass semigroup of some chosen place.| Search Query: arXiv Query: search_query=au:Ravichandran OR all:Guruswami&id_list=&start=0&max_results=3Read More