1.

Which of the following linear codes achieve largest possible minimum distance?(a) Hamming code(b) Hadamard code(c) Golay code(d) Reed Solomon codesThis question was posed to me by my school principal while I was bunking the class.This interesting question is from Block Codes and Finite Fields in portion Equalization, Diversity and Channel Coding of Wireless/Mobile

Answer»

Correct choice is (d) REED Solomon codes

The best explanation: RS codes achieve the largest possible minimum distance, dmin of any linear code. They are non-binary codes which are CAPABLE of correcting ERRORS that APPEARS in bursts.



Discussion

No Comment Found

Related InterviewSolutions