Decoding algebraic geometry codes by a key equation
From MaRDI portal
Publication:1587770
DOI10.1006/FFTA.1999.0274zbMATH Open0965.94026arXivmath/9910151OpenAlexW2045528863MaRDI QIDQ1587770FDOQ1587770
Authors: J. I. Farrán 
Publication date: 5 August 2001
Published in: Finite Fields and their Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/9910151
Recommendations
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Cites Work
- Algebraic coding theory
- Algebraic function fields and codes
- Title not available (Why is that?)
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Decoding algebraic-geometric codes up to the designed minimum distance
- Majority coset decoding
- On the decoding of algebraic-geometric codes
- Title not available (Why is that?)
- Effective construction of algebraic geometry codes
- Title not available (Why is that?)
- Decoding geometric Goppa codes using an extra place
- Title not available (Why is that?)
- Codes on the Klein quartic, ideals, and decoding (Corresp.)
- Achieving the designed error capacity in decoding 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)
