Question

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

I had been asked this question in an interview for job.

Enquiry is from Properties of Convolution Codes and Reed-Solomon Codes in section Channel Coding of Digital Communications

Answer 1

Right answer is (b) n-k+1

Easiest explanation: Reed Solomon code achieves the largest possible code minimum distance for any linear code and it is given by n-k+1.