1.

In a linear code, the minimum Hamming distance between any two codewords is minimum weight of any non-zero code word. a. Less than b. Greater than c. Equal to d. None of the above

Answer»

Correct option is c. Equal to 



Discussion

No Comment Found

Related InterviewSolutions