PadhaikoAll subjects

Past exam question: 2072 Kartik, Q9

Data Communication · 4 marks

Open in the Padhaiko app

Topic: Wireless propagation (Introduction to groundwave propagation, sky…

Question

Show the application of hamming distance with suitable example.

Solution

Definition of Hamming Distance: The Hamming distance between two binary codewords of equal length is defined as the number of bit positions in which they differ. Mathematically, it equals the Hamming weight of their modulo-2 sum:

The minimum Hamming distance of a code is the minimum distance between any pair of distinct codewords in the codebook:

Error Detection and Correction Capabilities:

  1. Error Detection: To detect up to bit errors in a transmission, the code must satisfy:
  1. Error Correction: To detect and correct up to bit errors, the code must satisfy:

Application Example: Consider a codebook designed to encode 2 datawords into 5-bit codewords:

  1. Calculate :
  1. Error Detection Capability:

If up to 4 bits are corrupted during transmission (e.g., ), the received sequence is not in the codebook, immediately flagging an error.

  1. Error Correction Capability:

Using nearest-neighbor (minimum distance) decoding:

Answer:

Hamming distance is the number of differing bit positions between two equal-length words; a code with minimum distance detects up to errors and corrects up to errors (e.g., codewords 00000 and 11111 have , correcting up to 2 bit errors).

All past exam questions for Data Communication