Patent ID: 7464323

Claim:
A method of encoding information symbols, comprising a step of: encoding the information symbols by calculating codewords, wherein each codeword v has a length n, being orthogonal to a parity matrix H and being associated with every block of k information symbols belonging to a Galois field F q , wherein q is an integer greater than 2 and equal to a power of a prime number, wherein element H αβ at position (α,β) of said parity matrix H, with α varying from 1 to n-k and β varying from 1 to n, is equal to the value taken by the monomial M α at the point P β , and wherein the monomials M α ≡X i Y i , where the integers i and j are positive or zero, are such that if, among those monomials, there is one at i>0 and arbitrary j, then there is also one at (i-1) and j, and if there is one at arbitrary i and j>0, then there is also one at i and (j-1), and said points P β are pairs of non-zero symbols of F q which have been classified by aggregates as follows when β varies from 1 to n: (x 1 ,y 1 (x 1 )),(x 1 ,y 2 (x 1 )), . . . ,(x 1 ,y λ 1 (x 1 ));(x 2 ,y 1 (x 2 )),(x 2 ,y 2 (x 2 )), . . . , (x 2 ,y λ 2 (x 2 )); . . . ;(x μ ,y 1 (x μ )),(x μ ,y 2 (x μ )), . . . ,(x μ,y λ μ (x μ )), where μ denotes the number of aggregates and, for any i between 1 and μ, λ i denotes the number of pairs with x i as a first element.