Forums

How to using the Reed-Solomon decoder for the polynomial reconstruction

Started by Yang February 10, 2004
Hi, I am dealing with a noisy polynomial reconstruction problem. I
read some material saying that the error correct RS decoder can be use
in this case. But I can not figure out the relationship between these
two. Can anybody explain a little for me. Thanks in advance.

Shenglin
Hi,

I must admit that I don't know anything about noisy polynomial
reconstruction, but I have worked on Reed-Solomon codes.  A
Reed-Solomon code can be expressed as a finite field polynomial. 
Also, h redundant symbols are calculated for k information symbols (or
coefficients) giving a total of n symbols.  The Reed-Solomon
code/polynomial now have the ability to correct any (h/2) incorrect
symbols/coefficients.

Hope this helps.
Jaco

yangshenglin75@yahoo.com (Yang) wrote in message news:<f333a7ba.0402101349.3374b950@posting.google.com>...
> Hi, I am dealing with a noisy polynomial reconstruction problem. I > read some material saying that the error correct RS decoder can be use > in this case. But I can not figure out the relationship between these > two. Can anybody explain a little for me. Thanks in advance. > > Shenglin