We use the formula, 2r >= m+r+1 where r = redundant bit & m = data bit.įrom the formula we can make out that there are 4 data bits and 3 redundancy bits, referring to the received 7-bit hamming code. Now the question arises, how do we determine the number of redundant bits to be added? All this is done to ensure that the data bits don't get damaged and if they do, we can recover them. The redundant bits are some extra binary bits that are not part of the original data, but they are generated & added to the original data bit. Let's say you have received a 7-bit Hamming code which is 1011011.įirst, let us talk about the redundant bits. Let's understand the Hamming code concept with an example: Whenever a data packet is transmitted over a network, there are possibilities that the data bits may get lost or damaged during transmission. The hamming code technique, which is an error-detection and error-correction technique, was proposed by R.W.
0 Comments
Leave a Reply. |