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.
We restate the theorem:<br />
<strong>THE</strong>OREM:<br />
The algorithm described above<br />
gives a sequence of pairs, (Q k (Z);P k (Z))<br />
for which<br />
L k = L(Q k (Z);P k (Z))<br />
That is: (Q k (Z);P k (Z)) is minimal.<br />
34