Which of the following linear codes achieve largest possible minimum distance?
(a) Hamming code
(b) Hadamard code
(c) Golay code
(d) Reed Solomon codes
This 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