DATA LINK LAYER WIRED NETWORKS
DATA LINK CONTROL DLC
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
0
|
|
|
1
|
|
|
n
|
|
|
n+1
|
Detailed explanation-1: -The Hamming distance between two codewords is simply the number of bit positions in which they differ. If the Hamming distance between two codewords c1 and c2 is d, and c1 is transmitted, then d errors would have to occur for codeword c2 to be received.
Detailed explanation-2: -Hamming codes have a minimum distance of 3, which means that the decoder can detect and correct a single error, but it cannot distinguish a double bit error of some codeword from a single bit error of a different codeword.
Detailed explanation-3: -What is the minimal Hamming distance between any two correct codewords? Explanation: Since we use a generalized version of Hamming(7, 4) code, the minimal hamming distance is 3.
Detailed explanation-4: -Definition 1 (Hamming distance) Given two vectors u, v ∈ Fn we define the hamming distance between u and v, d(u, v), to be the number of places where u and v differ. Thus the Hamming distance between two vectors is the number of bits we must change to change one into the other.