Decoding Algebraic Geometry codes by a key equation
J. I. Farran
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.
Create a lesson
Related papers
Towards the Global Torelli Theorem
Daniil Serebrennikov
Disjoint and nearly disjoint sums of matrix multiplication tensors and their centroids
Martin Kassabov, J. M. Landsberg, Victor Souza et al.
Proper moduli spaces of isolated non-normal singularities
Jiucheng Dai, Daniel Halpern-Leistner, Mingjun Sun et al.
Divisors in projective bundles over the projective line whose complement is affine space
Remy van Dobben de Bruyn
Numerical Godeaux Surfaces with many disjoint (-2)-curves and Applications
Yifan Chen, YongJoo Shin
Nash Loci
Luca Sodomaco, Julian Weigert