The Hamming distance between two code-words is

The Hamming distance between two code-words is

(A) the number of places the code-words are same

(B) same as the Euclidean distance between their decimal representation

(C) is maximum of the either code-words

(B) the number of places the code-words differ
by

1 Answer

Answer :

The Hamming distance between two code-words is the number of places the code-words differ

by

Related questions

The ________ between two words is the number ofdifferences between corresponding bits. A) Hamming code B) Hamming distance C) Hamming rule D) none of the above

Description : The ________ between two words is the number ofdifferences between corresponding bits. A) Hamming code B) Hamming distance C) Hamming rule D) none of the above

Last Answer : Hamming distance

The ________ between two words is the number of differences between corresponding bits A. Hamming code B. Hamming distance C. Hamming rule D. none of the above

Description : The ________ between two words is the number of differences between corresponding bits A. Hamming code B. Hamming distance C. Hamming rule D. none of the above

Last Answer : B. Hamming distance

Consider a code with five valid code words of length ten : 0000000000, 0000011111, 1111100000, 1110000011, 1111111111 Hamming distance of the code is (A) 5 (B) 10 (C) 8 (D) 9

Description : Consider a code with five valid code words of length ten : 0000000000, 0000011111, 1111100000, 1110000011, 1111111111 Hamming distance of the code is (A) 5 (B) 10 (C) 8 (D) 9

Last Answer : Answer: Marks to all

The bit positionina can be numbered from 1 through 2h, a. Hamming code word b. Hamming distance word c. Both d. None of these

Description : The bit positionina can be numbered from 1 through 2h, a. Hamming code word b. Hamming distance word c. Both d. None of these

Last Answer : a. Hamming code word

To guarantee correction ofup to 5 errors in all cases, the minimum Hamming distance in a block code must be________. A) 5 B) 6 C) 11 D) none of the above

Description : To guarantee correction ofup to 5 errors in all cases, the minimum Hamming distance in a block code must be________. A) 5 B) 6 C) 11 D) none of the above

Last Answer : 11

To guarantee the detectionof up to 5errors in all cases, the minimum Hamming distance in a block code mustbe _______. A) 5 B) 6 C) 11 D) none of the above

Description : To guarantee the detectionof up to 5errors in all cases, the minimum Hamming distance in a block code mustbe _______. A) 5 B) 6 C) 11 D) none of the above

Last Answer : 6

To guarantee correction of upto t errors, the minimum Hamming distance d min in a block code must be ________. a. t+1 b. t−2 c. 2t−1 d. 2t+1

Description : To guarantee correction of upto t errors, the minimum Hamming distance d min in a block code must be ________. a. t+1 b. t−2 c. 2t−1 d. 2t+1

Last Answer : d. 2t+1

To guarantee the detection of up to 5 errors in all cases, the minimum Hamming distance in a block code must be _______ A. 5 B. 6 C. 11 D. none of the above

Description : To guarantee the detection of up to 5 errors in all cases, the minimum Hamming distance in a block code must be _______ A. 5 B. 6 C. 11 D. none of the above

Last Answer : B. 6

In block coding, ifn = 5, the maximum Hamming distance between two codewords is ________. A) 2 B) 3 C) 5 D) none of the above

Description : In block coding, ifn = 5, the maximum Hamming distance between two codewords is ________. A) 2 B) 3 C) 5 D) none of the above

Last Answer : 5

The Hamming distance between 100 and 001 is ________. A) 2 B) 0 C) 1 D) none of the above

Description : The Hamming distance between 100 and 001 is ________. A) 2 B) 0 C) 1 D) none of the above

Last Answer : 2

The Hamming distance between equal codewords is _________. A) 1 B) n C) 0 D) none of the above

Description : The Hamming distance between equal codewords is _________. A) 1 B) n C) 0 D) none of the above

Last Answer : 0

Hamming distance between 100101000110 and 110111101101 is (A) 3 (B) 4 (C) 5 (D) 6

Description : Hamming distance between 100101000110 and 110111101101 is (A) 3 (B) 4 (C) 5 (D) 6

Last Answer : (D) 6

Is the cyclic redundancy check better than hamming code?

Description : Is the cyclic redundancy check better than hamming code?

Last Answer : It depends on what you are doing.The cyclic redundancy check will only detect an error, while thehamming code can also correct many types of errors. However toperform this correction the extra ... channels, disk sectors).Normally hamming code is done on individual bytes or words ofcomputer memory.

_______ can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits. a. Hamming Code b. CRC c. VRC d. None of the above

Description : _______ can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits. a. Hamming Code b. CRC c. VRC d. None of the above

Last Answer : b. CRC

Thus hamming code for the ASCII character “a” is given as ……………… A. 10111001111 B. 10111001000 C. 10111001001 D. 10111001

Description : Thus hamming code for the ASCII character “a” is given as ……………… A. 10111001111 B. 10111001000 C. 10111001001 D. 10111001

Last Answer : C. 10111001001

In a binary Hamming code the number of check digits is r then number of message digits is equal to: (A) 2r-1 (B) 2r-r-1 (C) 2r-r+1 (D) 2r+r-1

Description : In a binary Hamming code the number of check digits is r then number of message digits is equal to: (A) 2r-1 (B) 2r-r-1 (C) 2r-r+1 (D) 2r+r-1

Last Answer : (B) 2r-r-1

Coding schemes can be divided into two broad categories…………, ……A. character coding, integer coding B. hamming coding and block coding C. Hamming coding and convolution coding D. Block Coding and Convolution Coding.

Description : Coding schemes can be divided into two broad categories…………, …… A. character coding, integer coding B. hamming coding and block coding C. Hamming coding and convolution coding D. Block Coding and Convolution Coding.

Last Answer : D. Block Coding and Convolution Coding.

Hamming codes was developed in _ a 1953 b. 1950 c. 1945 d. 1956

Description : Hamming codes was developed in _ a 1953 b. 1950 c. 1945 d. 1956

Last Answer : b. 1950

Error detection ata data link level is achieved by A. bit stuffing B. cyclic redundancy codes C. Hamming codes D. equalization

Description : Error detection ata data link level is achieved by A. bit stuffing B. cyclic redundancy codes C. Hamming codes D. equalization

Last Answer : cyclic redundancy codes

Water hamming effect is occurs in a) Surge tank b) Penstock c) Turbine d) Reservoir

Description : Water hamming effect is occurs in a) Surge tank b) Penstock c) Turbine d) Reservoir

Last Answer : Ans: Penstock

Linear predictive code is widely used in

Description : Linear predictive code is widely used in 

Last Answer : Linear predictive code is widely used in speech coding to reduce the bandwidth

The computer code for interchange of information between terminals is ____.

Description : The computer code for interchange of information between terminals is ____.  a) ASCII b) ACSII c) ASICI d) ASIIC

Last Answer : The computer code for interchange of information between terminals is ASCII.

Which is used for code -in -line model?

Description : Which is used for code -in -line model?  A) < script runat="server"> C) Both B) < script javascript="server"> D) None

Last Answer : Which is used for code -in -line model?  < script runat="server">

The address range for M = 64 words storage in hexadecimal format is

Description : The address range for M = 64 words storage in hexadecimal format is  1. 00 to 3F  2. 00 to FF  3. 0 to 3  4. 0 to F

Last Answer : The address range for M = 64 words storage in hexadecimal format is 00 to 3F