in Computer Networks retagged by
677 views
2 votes
2 votes

Which of the following is/are true in context of error control?

  1. A CRC of length $\text{R}$ is calculated over a message of length $\text{M}$ bits. The CRC will detect all errors in the message.
  2. The strings $10001$ and $11001$ have a Hamming distance of one.
  3. If a single parity bit is added to a message, the resulting code set has a minimum Hamming distance of two.
  4. A larger Hamming distance is needed to detect errors than to correct errors.
in Computer Networks retagged by
677 views

1 comment

Good question
0
0

1 Answer

3 votes
3 votes

1. We can't detect all the errors with single CRC False

2. HD is 1 True

3.Purpose of parity bit is to detect single errors. So if any one bit from the data changes the parity bit  will change too. So in total 2 bits have changed. So  the min HD is 2

True

4. To detect d+1 and to correct 2d+1. Clearly we need more to correct.False

edited by

4 Comments

Option C explanation:

Suppose that for a message, we are adding a single parity bit.

Ex: message : 1101. if we go by evenparity then the parity bit that will be added is 1.

now,code word: 11011.

suppose we flip 2nd bit in the code word (1 → 0). so, to maintain even parity the parity bit will also change from (1 → 0).

new code word : 10010

hamming distance between initial code word and new code word is 2.

Hence, the minimum hamming distance possible is 2.

 

1
1
but can you plz tell why you are changing the codeword ?
0
0
To find hamming distance we need 2 code words. From my example, we already have a code word which is 11011. For the second code words, you are free to choose any code word and find hamming distance, but inorder to get a minmum hamming distance, im choosing the other code word with just 1 bit change in the message word.
1
1
Answer:

Related questions