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 ...
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
MA<strong>THE</strong>MATICALLY:<br />
Let<br />
G(Z) = N,M Y<br />
i=1<br />
(Z , i )<br />
Let (m 1 ;m 2 ;;m M ) be a message where<br />
m i 2 GF (2 n ).<br />
Dene a polynomial by<br />
P (Z) =m 1 +m 2 Z+m 3 Z 2 ++m M Z M,1<br />
and dene<br />
C(Z) = P (Z)G(Z)<br />
X<br />
= N ,1<br />
i=0<br />
c i Z i<br />
Then the codeword is<br />
(c 0 ;c 1 ;;c N,1 )<br />
6
Change language