Discussion
Hamming distance between the codes 1110100 and 1111001 is :
Answer: D
The Hamming distance is 3.
The Hamming distance is the number of positions in which two codewords differ. Comparing them bit by bit:
\[ \begin{aligned} &1110100 \\ &1111001 \\ &0001101 \end{aligned} \]
The last line, the bitwise XOR, has 1s in positions 4, 5 and 7, so the codes differ in 3 places. 0 would mean identical codes, and 1 or 2 undercount the differences.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development