Question

A Hamming code needs a dataword of at least 24 bits. Calculate the values of k and n that satisfy this requirement?

Answer 1

Solution:

Given,

=>Minimum dataword bits(p) = 24

Explanation:

Calculating number of check bits(r):

=>We know that 2^r p + r + 1

Put p = 24

=>2^r 24 + r + 1

=>2^r 25 + r

=>Hence minimum value of r = 5 satisfying the 2^r 25 + r condition hence number of check bits(r) = 5.

Finding value of n:

=>We know that n = 2^r - 1

=>n = 2^5 - 1

=>n = 32 - 1

=>n = 31

Finding value of k:

=>We know that k = n - r

=>k = 31 - 5

=>k = 26

I have explained each and every part with the help of statements attached to it.