Decoding algebraic geometry codes by a key equation

From MaRDI portal




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.









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)