Unique Decoding of General AG Codes
From MaRDI portal
Abstract: A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it retains the same advantages of fast speed and regular structure with the previous algorithm. Compared with other known decoding algorithms for general AG codes, it is much simpler in its description and implementation.
Recommendations
- Unique decoding of plane AG codes revisited
- Decoding of differential AG codes
- Unique Decoding of Plane AG Codes via Interpolation
- Fast unique decoding of plane AG codes
- Generalized AG convolutional codes
- Conjectural permutation decoding of some AG codes
- Generalized AG codes and generalized duality
- A Geometric View of Decoding AG Codes
- Computing initial data for decoding algorithms for general AG codes
- scientific article; zbMATH DE number 4104870
Cited in
(8)- Improved power decoding of interleaved one-point Hermitian codes
- Bounds for generalized Hamming weights of general AG codes
- On the evaluation codes given by simple \(\delta \)-sequences
- Is Non-Unique Decoding Necessary?
- Decoding of differential AG codes
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- Conjectural permutation decoding of some AG codes
- The conorm code of an AG-code
This page was built for publication: Unique Decoding of General AG Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986428)