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

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

1 Answer

Answer :

0
by

Related questions

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

We addr redundant bits toeach block to make thelength n = k + r. The resultingn-bit blocksare called _________. A) datawords B) blockwords C) codewords D) none of the above

Description : We addr redundant bits toeach block to make thelength n = k + r. The resultingn-bit blocksare called _________. A) datawords B) blockwords C) codewords D) none of the above

Last Answer : codewords

We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are called _________ A. datawords B. blockwords C. codewords D. none of the above

Description : We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are called _________ A. datawords B. blockwords C. codewords D. none of the above

Last Answer : C. codewords

In block coding, if k =2 and n =3, we have _______ invalid codewords. A) 8 B) 4 C) 2 D) none of the above

Description : In block coding, if k =2 and n =3, we have _______ invalid codewords. A) 8 B) 4 C) 2 D) none of the above

Last Answer : 2

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

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

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

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

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

_______ 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

In a linear block code, the_______ ofany two valid codewords creates another valid codeword. A) XORing B) ORing C) ANDing D) none of the above

Description : In a linear block code, the_______ ofany two valid codewords creates another valid codeword. A) XORing B) ORing C) ANDing D) none of the above

Last Answer : XORing

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

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.

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

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

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

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 Hamming distance between two code-words is

Description : 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

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

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

Inthe _________ protocol weavoid unnecessary transmissionby sending only frames that are corrupted. A) Stop-and-Wait ARQ B) Go-Back-N ARQ C) Selective-Repeat ARQ D) none of the above

Description : Inthe _________ protocol weavoid unnecessary transmissionby sending only frames that are corrupted. A) Stop-and-Wait ARQ B) Go-Back-N ARQ C) Selective-Repeat ARQ D) none of the above

Last Answer : Selective-Repeat ARQ

The secondgeneration of cable networks is called a(n) _________ network. A) HFC B) HCF C) CFH D) none of the above

Description : The secondgeneration of cable networks is called a(n) _________ network. A) HFC B) HCF C) CFH D) none of the above

Last Answer : HFC

A(n)_________ signal is a composite analogsignal with an infinite bandwidth. A) digital B) analog C) either (a)or (b) D) neither (a) nor (b

Description : A(n)_________ signal is a composite analogsignal with an infinite bandwidth. A) digital B) analog C) either (a)or (b) D) neither (a) nor (b

Last Answer : digital

The distance between two stations M and N is L kilometers. All frames are K bits long. The propagation delay per kilometer is t seconds. Let R bits/second be the channelcapacity. Assuming that processing delay is negligible, the minimum number of bits for the sequence number field in a frame for maximum utilization, when the sliding window protocol used is: a. A b. B c. C d. D

Description : The distance between two stations M and N is L kilometers. All frames are K bits long. The propagation delay per kilometer is t seconds. Let R bits/second be the channel capacity. Assuming that processing ... maximum utilization, when the sliding window protocol used is: a. A b. B c. C d. D

Last Answer : c. C

In Ethernet addressing, if the least significant bit of the firstbyte is 0, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Description : In Ethernet addressing, if the least significant bit of the firstbyte is 0, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : unicast

Adding 1 and 1 in modulo-2arithmetic results in _________. A) 1 B) 2 C) 0 D) none of the above

Description : Adding 1 and 1 in modulo-2arithmetic results in _________. A) 1 B) 2 C) 0 D) none of the above

Last Answer : 0

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.

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

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

Based onthe Clos criteria, if N = 200, then the minimum number of crosspoints isgreater thanor equal to _______. A) 15,200 B) 18,000 C) 42,000 D) 20,000

Description : Based onthe Clos criteria, if N = 200, then the minimum number of crosspoints isgreater thanor equal to _______. A) 15,200 B) 18,000 C) 42,000 D) 20,000

Last Answer : 15,200

Based onthe Clos criteria, if N = 200, then k mustbe equal to or greater than____. A) 21 B) 19 C) 31 D) 41

Description : Based onthe Clos criteria, if N = 200, then k mustbe equal to or greater than____. A) 21 B) 19 C) 31 D) 41

Last Answer : 19

Based onthe Clos criteria, if N = 200, then n mustbe equal to or greater than____. A) 10 B) 20 C) 30 D) 40

Description : Based onthe Clos criteria, if N = 200, then n mustbe equal to or greater than____. A) 10 B) 20 C) 30 D) 40

Last Answer : 10

In Bluetooth, multiple ________ form a network called a _________. A) scatternet; piconets B) piconets: scatternet C) piconets:bluenet D) bluenet; scatternet

Description : In Bluetooth, multiple ________ form a network called a _________. A) scatternet; piconets B) piconets: scatternet C) piconets:bluenet D) bluenet; scatternet

Last Answer : piconets: scatternet

The IEEE 802.11g, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Description : The IEEE 802.11g, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Last Answer : OFDM

The IEEE 802.11b, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Description : The IEEE 802.11b, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Last Answer : DSSS

The IEEE 802.11a, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Description : The IEEE 802.11a, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Last Answer : OFDM

The original IEEE 802.11,uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Description : The original IEEE 802.11,uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Last Answer : either (a)or (b)

In IEEE 802.11, the access method used in the DCF sublayer is _________. A) ALOHA B) CSMA/CA C) CSMA/CD D) none of the above

Description : In IEEE 802.11, the access method used in the DCF sublayer is _________. A) ALOHA B) CSMA/CA C) CSMA/CD D) none of the above

Last Answer : CSMA/CA

In IEEE 802.11, a BSS without an AP is called an _________. A) an ad hocarchitecture B) an infrastructurenetwork C) either (a) or (b) D) neither (a) nor (b)

Description : In IEEE 802.11, a BSS without an AP is called an _________. A) an ad hocarchitecture B) an infrastructurenetwork C) either (a) or (b) D) neither (a) nor (b)

Last Answer : an ad hocarchitecture

Inthe _________ method, a special packet called a ______ circulates through the ring. A) reservation: control frame B) polling: poll request C) token passing: token D) none of the above

Description : Inthe _________ method, a special packet called a ______ circulates through the ring. A) reservation: control frame B) polling: poll request C) token passing: token D) none of the above

Last Answer : token passing: token

Inthe _________ method, after the station finds the lineidle, it sends its frame immediately. If the line isnot idle, it continuously senses theline until it finds it idle. A) nonpersistent B) 1-persistent C) p-persistent D) none of the above

Description : Inthe _________ method, after the station finds the lineidle, it sends its frame immediately. If the line isnot idle, it continuously senses theline until it finds it idle. A) nonpersistent B) 1-persistent C) p-persistent D) none of the above

Last Answer : 1-persistent

1000Base-SX, 1000Base-LX, and 1000Base-CX use _________ block coding and ________ line coding. A) 4B/5B; NRZ B) 8B/10B; NRZ C) 4B/5B; MLT-3 D) 8B/10B; NRZ

Description : 1000Base-SX, 1000Base-LX, and 1000Base-CX use _________ block coding and ________ line coding. A) 4B/5B; NRZ B) 8B/10B; NRZ C) 4B/5B; MLT-3 D) 8B/10B; NRZ

Last Answer : 8B/10B; NRZ

In Ethernet addressing, ifall the bits are 1s, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Description : In Ethernet addressing, ifall the bits are 1s, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : broadcast

In Ethernet addressing, if the least significant bit of the firstbyte is 1, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Description : In Ethernet addressing, if the least significant bit of the firstbyte is 1, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : multicast

_________ uses four twisted pairs. A) 1000Base-SX B) 1000Base-LX C) 1000Base-T D) none of the above

Description : _________ uses four twisted pairs. A) 1000Base-SX B) 1000Base-LX C) 1000Base-T D) none of the above

Last Answer : 1000Base-T

In _________, autonegotiation allows two devices to negotiate the mode or datarate of operation. A) Standard B) Fast Ethernet C) Gigabit Ethernet D) Ten-Gigabit Ethernet

Description : In _________, autonegotiation allows two devices to negotiate the mode or datarate of operation. A) Standard B) Fast Ethernet C) Gigabit Ethernet D) Ten-Gigabit Ethernet

Last Answer : Fast Ethernet

_________ uses thin coaxial cable. A) 10Base5 B) 10Base2 C) 10Base-T D) 10Base-F

Description : _________ uses thin coaxial cable. A) 10Base5 B) 10Base2 C) 10Base-T D) 10Base-F

Last Answer : 10Base2

The IEEE 802.3 Standard defines _________ CSMA/CD as the access method for first-generation 10-Mbps Ethernet. A) 1-persistent B) p-persistent C) non-persistent D) none of the above

Description : The IEEE 802.3 Standard defines _________ CSMA/CD as the access method for first-generation 10-Mbps Ethernet. A) 1-persistent B) p-persistent C) non-persistent D) none of the above

Last Answer : 1-persistent

Membership in a VLAN can be based on _________. A) port numbers B) MAC addresses C) IP addresses D) all of theabove

Description : Membership in a VLAN can be based on _________. A) port numbers B) MAC addresses C) IP addresses D) all of theabove

Last Answer : all of theabove