1,265 views
–1 –1 vote

I am getting min Hamming distance = 1. But no such option.

Also Is there any way to find Valid/Invalid Codewords?

1 Answer

0 0 votes
between code 10101 and 10001 only one bit difference.

yes hamming distance is 1 (p)

hence error detected = hamming distance -1 hence 0 (q).
Position:
Show:

Related questions

2 2 votes
1 1 answer
635
635 views
0 0 votes
1 1 answer
1.2k
1.2k views
Pravin Paikrao asked Jul 14, 2017
1,208 views
P1 = XOR of bits (3, 5, 7, 9, 11) = 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 = 0P2 = XOR of bits (3, 5, 7, 10, 11) = 1 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 = 0P4 = XOR of bits (5, 6, 7, 12) = 1 ⊕ 0 ⊕ 0 ⊕ 0 = 1P...
2 2 votes
1 1 answer
612
612 views
GO Classes asked Oct 4, 2025
612 views
A block code scheme has the following set of valid code words:$$000111,011001,100101,111010$$What is the maximum number of bit errors that can be detected?$1$ $2$ $3$ $4$
1 1 vote
2 answers 2 answers
1.2k
1.2k views
Souvik33 asked Jan 12, 2023
1,198 views
What is the earliest stage compiler error for the following C code snippet:int x = @33;Lexical ErrorSyntax ErrorSemantic ErrorNone