THE ORIGINAL VIEW OF REED-SOLOMON CODES THE ORIGINAL ...

THEOREM:
The algorithm described above
gives a sequence of pairs, (Q k (Z);P k (Z))
for which
L k = L(Q k (Z);P k (Z))
That is: (Q k (Z);P k (Z)) is minimal.
I will just list the lemmas, with
a comment about some of them.
Lemma 1
L k is monotone increasing.
Lemma 2
If 2L k k then there is
a unique minimum pair satisfying
the rst k equations.
31