• retagged by
837 views

1 Answer

2 2 votes

I didn't hear these two terms double errors or quadruple errors, but the minimum hamming distance of these 4 given codewords is 5, because EXOR any two pairs, and then count number of 1's in the result and then consider minimum number of 1's among all results.
Here it's 5, hence it gives a gaurantee to detect upto 4 bit errors, though it may/may not detect an error of more than 4 bits.
this is called minimum hamming distance.

It can't give a gaurantee to detect upto 5 bits error, because change into 5 bits can become another valid codeword which can't be caught. After change into 5 bits, there is a possibility that it may turn into a valid codeword.

For example if codeword is sent as 1111100000, last 5 bits are modified due to noisy channel and it becomes 11111111, now see, this is a valid codeword matching with one of the codewords.

• edited
Position:
Show:

Related questions

0 0 votes
0 0 answers
518
518 views
ajaysoni1924 asked Mar 15, 2019
518 views
Give two reasons why networks might use an error-correcting code instead of errordetection and retransmission.
2 2 votes
1 1 answer
390
390 views
5 5 votes
1 1 answer
500
500 views
GO Classes asked Aug 18, 2025
500 views
Let $k$ be minimum number of bits needed to correct all possible $t$ bits error then which of the following condition must satisfy? $2^{n-k} \geq \dbinom{n}{1} + \dbinom{...
1 1 vote
3 3 answers
1.6k
1.6k views
admin asked Sep 28, 2024
1,576 views
Which of the following is true?Both Parity and Cyclic Redundancy Check are error correcting codesBoth Parity and Low Density Parity Check Code are error correcting codesB...