Fast Unique Decoding of Plane Ag Codes
نویسنده
چکیده
An interpolation-based unique decoding algorithm of Algebraic Geometry codes was recently introduced. The algorithm iteratively computes the sent message through a majority voting procedure using the Gröbner bases of interpolation modules. We now combine the main idea of the Guruswami-Sudan list decoding with the algorithm, and thus obtain a hybrid unique decoding algorithm of plane AG codes, significantly improving the decoding speed.
منابع مشابه
Unique Decoding of Plane AG Codes Revisited
We reformulate a recently introduced interpolation-based unique decoding algorithm of algebraic geometry codes using the theory of Gröbner bases of modules on the coordinate ring of the base curve. With the same decoding performance, the new algorithm has a more conceptual description that lets us better understand the majority voting procedure central in the interpolation-based unique decoding.
متن کاملList Decoding Algorithm based on Voting in Gröbner Bases for General One-Point AG Codes
We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amorós, and O’Sullivan [31] to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construction, prove equality between its error correcting capa...
متن کاملList Decoding Algorithm based on Voting in Groebner Bases for General One-Point AG Codes
We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amorós and O’Sullivan to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construction, analyze its error correcting capability that has not b...
متن کاملList decoding algorithms based on Gröbner bases for general one-point AG codes
We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O’Sullivan [18] based on Gröbner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander [4]. By using the same principle, we also generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amorós and O’Sullivan...
متن کاملGeneralization of the Lee-O'Sullivan List Decoding for One-Point AG Codes
We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O’Sullivan [8] based on Gröbner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander [2]. Our generalization enables us to apply the fast algorithm to compute a Gröbner basis of a module proposed by Lee and O’Sullivan [8], which was not possible in another generalizat...
متن کامل