Decoding algebraic geometry codes by a key equation

DOI10.1006/FFTA.1999.0274MaRDI QIDQ1587770zbMATH OpenOpenAlexFDO

Authors J. I. Farrán

Publication date 5 August 2001

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9910151

zbMATH Keywords

algebraic-geometric codes decoding Duursma's majority coset scheme

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

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.

Review text

The paper deals with the decoding problem for general algebraic-geometric codes. Effective decoding can be done by solving key equations, generalizing ideas of Berlekamp-Mattey and Feng-Rao. A new decoding algorithm is proposed which improves both the decoding capacity and the complexity, with the only further assumption that there is an extra rational point on the curve which is not used in the construction of the algebraic-geometric codes. A central role is played by Duursma's majority coset scheme.

Recommendations

Cites work

Cited in

(5)

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)