Patent ID: 8296632
Filing Date: 2012-10-23
Classification: H03M,H04L

Abstract:
1. A method of encoding an input vector of k symbols to obtain r redundant symbols, the k symbols being defined over a finite field of q elements using a generalized Reed-Solomon code, the method comprising: selecting a divisor p of q−1, wherein p is greater than 1; selecting a primitive element a of the field GF(q); computing p generator polynomials, wherein the degree of each generator polynomial is equal to an integer that is the nearest integer greater than r/p or the nearest integer less than r/p; representing, by an encoder implemented at least in part with at least one processor, the input vector as a value having a length that is evenly divisible by p to form an extended input vector having a length equal to or greater than the length of the input vector; subdividing, by the encoder, logically or physically, the extended input vector into p equal vector parts; performing, by the encoder, a transformation of the p vector parts to obtain p intermediate parts, each intermediate part having a length m, wherein each symbol of each of the intermediate parts is depends from the symbols of the p vector parts; performing, by the encoder, concurrently or substantially concurrently with the transformation, an encoding operation on each intermediate part to obtain p blocks of intermediate redundant symbols; post-processing by the encoder, the p blocks of intermediate redundant symbols; performing, by the encoder, another transformation of the p post-processed blocks of intermediate redundant symbols to obtain p blocks of second intermediate redundant symbols; and performing, by the encoder, another post-processing operation on the p second intermediate redundant symbols to obtain p blocks of redundant symbols, wherein the p blocks of redundant symbols represent the r redundant symbols.