Patent ID: 7409629

Claim:
A method performed by a decoding device for decoding a one-point algebraic geometric code of dimension k and length n, wherein, in order to identify a position of errors in a received word, a syndromes matrix S, of size (n−k)×(n−k), is defined, of which elements S ij of each line I are calculated, for j between 1 and w(I), wherein boundary w is a decreasing function, using syndrome s of the received word, said method comprising matrix construction steps numbered by u, during which matrices S u are constructed starting with S 1 =S, and wherein each matrix S u for u>1 is obtained from matrix S u−1 by performing: where appropriate, permutations on columns of the matrix S u−1 , then linear manipulations involving a line of index u of the matrix so obtained, and wherein the construction of matrices terminates when: either S u uj =0 for all j between 1 and w(u), or there is an integer u*≦(u−1) such that S u* u*j =0 for all j between 1 and w(u).