Question

What is the rate of hamming codes?

(a) 1-[r/(2^r-1)]

(b) 1-(r/2^r)

(c) 1+(r/2^r)

(d) r/2^r+1

This question was posed to me in a job interview.

I want to ask this question from Checksum, Complexity Classes & NP Complete Problems topic in portion Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II

Answer 1

Correct option is (a) 1-[r/(2^r-1)]

The best explanation: Rate of a hamming code is message length divided by block length (i.e.) 2^r-r-1/2^r-1 = 1-[r/(2^r-1)]. It is the highest rate for a minimum distance of three.