The minimum distance for Reed Solomon code is given by
A. n+k+1
B. n-k+1
C. 1-n-k
D. 1+n-k
Answer:A
The minimum distance for Reed Solomon code is given by
A. n+k+1 B. n-k+1 C. 1-n-k D. 1+n-k
Explanation: Reed Solomon code achieves the largest possible code minimum distance for any linear code and it is given by n-k+1.