Question
How do you calculate the number of parity bits needed for a given data word length in Hamming Code?
Asked by: USER1742
99 Viewed
99 Answers
Answer (99)
The number of parity bits (r) required for a data word of length (m) is determined by the smallest integer 'r' that satisfies the inequality: 2^r >= m + r + 1. This ensures enough parity bits to cover both the data bits and the parity bits themselves, as well as to identify the location of the error.