Question

If the hamming distance between a dataword and the corresponding codeword is three, there are _____ bits in error." 5 4 3 none of the above

Answer 1

The appropriate answer would be 3 .

" In the event that the hamming distance between data word and the comparing code word is three, there are three bits in an error . "

Hamming distance can be calculated between two data words, it is between data-word and code-word here .

Answer 2

Answer: (3) 3

Concept : Hamming Distance

Given : (1) 5

            (2) 4

            (3) 3

            (4) None of the above

To Find : If the hamming distance between a data - word and the

               corresponding codeword is three, there are _____ bits in error.

Explanation:

Hamming distance is a measurement or standard for comparing two binary data strings. When comparing two binary strings of equal length, Hamming distance is the number of bit positions in which the two bits differ. The Hamming distance between two strings, a and s is denoted as d(a, s). Hamming distance is used for error detection or error correction when data is transmitted over computer networks, as during transmission of data some disturbance or noise could change or alter the data. Hamming distance is also used in coding theory for comparing equal length data words. So, if the distance between the data word and code word is three, then there are three bits in error.

#SPJ2