THE ORIGINAL VIEW OF REED-SOLOMON CODES THE ORIGINAL ...
THE ORIGINAL VIEW OF REED-SOLOMON CODES THE ORIGINAL ...
THE ORIGINAL VIEW OF REED-SOLOMON CODES THE ORIGINAL ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
CLASSICAL DECODING<br />
[W.W. Peterson, IRE IT-6 Sept 1960]<br />
Receive (r 1 ;r 2 ;;r N )<br />
and form<br />
R(Z) =<br />
C( i ) = 0<br />
N X<br />
i=1<br />
r i Z i,1<br />
= C(Z)+E(Z)<br />
S i = R( i ) = E( i )<br />
for 1 i N , M<br />
for 1 i N , M<br />
Peterson observed that the S i satisfy a linear recursion.<br />
0= e X<br />
i=0<br />
q i S k+i<br />
for 1 k N , M , e<br />
where Q(Z) = P e<br />
i=0<br />
q i Z i has the error locations as<br />
its roots.<br />
This gives a simple system of linear equations to<br />
nd the error locations. Another system solves for<br />
the error values.<br />
10