Unique decoding of plane AG codes revisited
From MaRDI portal
Abstract: We reformulate a recently introduced interpolation-based unique decoding algorithm of algebraic geometry codes using the theory of Gr"obner 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.
Recommendations
- Fast unique decoding of plane AG codes
- On the decoding of algebraic-geometric codes
- Gröbner basis approach to list decoding of algebraic geometry codes
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- Efficient list decoding of a class of algebraic-geometry codes
Cited in
(8)- On the evaluation codes given by simple \(\delta \)-sequences
- Unique Decoding of General AG Codes
- Decoding of differential AG codes
- A tutorial on AG code decoding from a Gröbner basis perspective
- Efficient Forney functions for decoding AG codes
- The root diagram for one-point AG codes arising from certain curves with separated variables
- Fast unique decoding of plane AG codes
- Conjectural permutation decoding of some AG codes
This page was built for publication: Unique decoding of plane AG codes revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5407157)