The parity function is a very simple hash function producing a one-bit digest, which is 0 if the number of bits in the message is even and 1 if it is odd. Consider a communication system that uses 7 bits out of every byte to transmit data, and reserves the 8th bit (the one on the right) to transmit the parity of the other seven bits, for purposes of error checking. Below is the binary representation of some bytes that were transmitted using this system. For each one, tell whether there is a reason to suspect an error in transmission, giving the reason for your answer. 10110011 11101111 10101100 00110011
The parity function is a very simple hash function producing a one-bit digest, which is 0 if the number of bits in the message is even and 1 if it is odd.
Consider a communication system that uses 7 bits out of every byte to transmit data, and reserves the 8th bit (the one on the right) to transmit the parity of the other seven bits, for purposes of error checking.
Below is the binary representation of some bytes that were transmitted using this system. For each one, tell whether there is a reason to suspect an error in transmission, giving the reason for your answer.
10110011
11101111
10101100
00110011
Hamming code is a bunch of error detection codes that can be utilized to distinguish and address the blunders that can happen when the information is moved or put away from the source to the collector. It is strategy created by R.W. Hamming for erroe detection.
Redundant bits -
Redundant bits are additional twofold pieces that are created and added to the data conveying pieces of information move to guarantee that no pieces were lost during the information move.
The quantity of excess pieces can be determined utilizing the accompanying recipe:
2^r ≥ m + r + 1
where, r = excess piece, m = information bit
Assume the quantity of information pieces is 7, then, at that point, the quantity of excess pieces can determined use:
= 2^4 ≥ 7 + 4 + 1
Consequently, the quantity of repetitive bits= 4
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 9 images
