PadhaikoAll subjects

Past exam question: 2071 Chaitra, Q13(a)

Data Communication · 2 marks

Open in the Padhaiko app

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

Question

Discuss the concept of redundancy in error detection and correction. Define Hamming distance?

Solution

Concept of Redundancy: Redundancy refers to the addition of extra check bits () to a message dataword that convey no new information on their own, but establish a mathematical constraint between all transmitted bits.

Definition of Hamming Distance: The Hamming distance between two binary words and of equal length is the number of bit positions in which the corresponding bits differ.

where is the bitwise XOR operator and is the Hamming weight (number of 1s).

Answer:

Redundancy adds extra check bits to datawords so only a sparse subset of -bit patterns are valid codewords, letting receivers detect or correct corruptions. Hamming distance is the number of bit positions where two equal-length words differ; bounds detection () and correction ().

All past exam questions for Data Communication