Decoding algebraic geometry codes by a key equation
From MaRDI portal
(Redirected from Publication:1587770)
Abstract: A new effective decoding algorithm is presented for arbitrary algebraic-geometric codes on the basis of solving a generalized key equation with the majority coset scheme of Duursma. It is an improvement of Ehrhard's algorithm, since the method corrects up to the half of the Goppa distance with complexity order O(n**2.81), and with no further assumption on the degree of the divisor G.
Recommendations
Cites work
- scientific article; zbMATH DE number 417878 (Why is no real title available?)
- scientific article; zbMATH DE number 52992 (Why is no real title available?)
- scientific article; zbMATH DE number 727424 (Why is no real title available?)
- scientific article; zbMATH DE number 3288410 (Why is no real title available?)
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Achieving the designed error capacity in decoding algebraic-geometric codes
- Algebraic coding theory
- Algebraic function fields and codes
- Codes on the Klein quartic, ideals, and decoding (Corresp.)
- Decoding algebraic-geometric codes up to the designed minimum distance
- Decoding geometric Goppa codes using an extra place
- Effective construction of algebraic geometry codes
- Majority coset decoding
- On the decoding of algebraic-geometric codes
Cited in
(4)
This page was built for publication: Decoding algebraic geometry codes by a key equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587770)