This question was previously asked in

NIELIT Scientist B Official Paper 2020

Option 2 : 6

NIC Scientist B 2020: Full Mock Test

2801

120 Questions
120 Marks
180 Mins

__Concept:__

Hamming distance between two words of the same size is the number of differences between the corresponding bits. It can be calculated by applying the XOR operation.

__Formula:__

To guarantee the detection of up to s errors in all cases, the hamming distance in a block code must be d ≥ s + 1

Let hamming distance be minimum

∴ dmin = s + 1

__Calculation__

number of errors = s = 5.

∴ dmin = (5) + 1 = 6

__Important Point:__

Minimum Hamming distance is the smallest hamming distance between all possible pairs in a set of words. There are three parameters in this: codeword size, data word size, and minimum Hamming distance. When a codeword is corrupted during transmission, the hamming distance between sent and the received codeword is the number of bits affected by the error.