Question discussion

How many parity (check) bits are required in a Hamming code to correct single-bit errors in 11 data bits?

1345Medium DSSSB TGT Computer Science 0 replies 1 views

Correct answer: A

Explanation

The smallest r satisfying 2^r ≥ m + r + 1 for m = 11 is r = 4, since 16 ≥ 16 (r = 3 gives 8 < 15).

Nobody has replied yet. Start the discussion!