Patent attributes
A method of decoding a one-point algebraic geometric code of dimension k and length n, in which, in order to identify the position of the errors in a received word, the syndromes matrix S, of size (n−k)×(n−k), is defined, of which the elements Sij of each line i are calculated, for j between 1 and w(i), where the boundary w is a decreasing function, using the syndrome s of the received word. Matrices Su are constructed for the successive values of u starting with S1=S, and, for u>1, each matrix Su is obtained by performing on the matrix Su−1, column permutations where appropriate, then linear manipulations involving the line of index u. These steps are performed in such a manner as to find a matrix Sλ which has a line of index less than or equal to λ of which the elements are zero in the first w(λ) columns. The invention also relates to devices and apparatuses adapted to implement this method.
