Thus, your only task is to find the magnitudes of the erasures. A Reed-Solomon (n,K) code can successfully correct as many as 2t=n–K erasures if no errors are present. With both errors and erasures ...