Fast decoding of codes from algebraic plane curves
From MaRDI portal
Recommendations
Cited in
(26)- Decoding of codes on an elliptic curve with number of errors greater than half the designed code distance
- Algebraic geometry codes of curves of complete intersection
- The key equation for one-point codes and efficient error evaluation
- Evaluation codes defined by finite families of plane valuations at infinity
- On the subfield subcodes of Hermitian codes
- Gröbner basis approach to list decoding of algebraic geometry codes
- On the evaluation codes given by simple \(\delta \)-sequences
- On a decoding algorithm for codes on maximal curves
- On the number of correctable errors for some AG-codes
- Algebraic decoding using special divisors
- Fast decoding of codes from algebraic curves
- Simplified understanding and efficient decoding of a class of algebraic-geometric codes
- scientific article; zbMATH DE number 729867 (Why is no real title available?)
- scientific article; zbMATH DE number 1161286 (Why is no real title available?)
- scientific article; zbMATH DE number 1974618 (Why is no real title available?)
- Decoding of Hermitian codes: the key equation and efficient error evaluation
- Construction and decoding of a class of algebraic geometry codes
- scientific article; zbMATH DE number 1839528 (Why is no real title available?)
- Fast decoding of algebraic-geometric codes up to the designed minimum distance
- Decoding of codes defined by a single point on a curve
- Fast unique decoding of plane AG codes
- Planar Convex Codes are Decidable
- On quasilinear-time complexity theory
- Power error locating pairs
- Aggregate error locator and error value computation in AG codes
- Improved evaluation codes defined by plane valuations
This page was built for publication: Fast decoding of codes from algebraic plane curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3991394)