1.

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-kI 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»

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.



Discussion

No Comment Found

Related InterviewSolutions