Q. The divisor line and XOR are missing if the corresponding bit in the divisor is

View solution

Q. The unsigned representation of numbers by one's complement can represent

View solution

Q. The checksum is used in the Internet by several protocols although not at the

View solution

Q. A simple parity-check code can detect

View solution

Q. The hamming distance can easily be found if we apply the

View solution

Q. In subtraction of modulo-2 arithmetic, 0-1 =

View solution

Q. In modulo-N arithmetic, we use only the integers in the range

View solution

Q. To detect or correct errors, we send extra bits with data. It is called

View solution

Q. A good polynomial generator of the cyclic code have at least

View solution

Q. The dataword is organized in the form of

View solution

Q. A simple parity-check code is the most familiar

View solution

Q. What are the bits transmitted for the NRZ-L system?

View solution

Q. What are the bits transmitted for the return to zero system?

View solution

Q. What are the bits transmitted in the differential Manchester coding?

View solution

Q. What are the bits transmitted for the AMI and Pseudoternary System?

View solution

Q. Five channels, each with a 100-kHz bandwidth, are to be multiplexed together. What is the minimum bandwidth of the link if there is a need for a guard band of 10 kHz between the channels to prevent interference?

View solution

Q. Find the checksum byte for the following data words:
10110011, 10101011, 01011010, 11010101

View solution

Q. Generate the CRC codeword for the message x^3+1 using the generator polynomial x^3+x+1.

View solution

Q. Generate the CRC codeword for the data word 1101011011 using generator 10011.

View solution

Q. What is the hamming distance between these 2 codes: 10010010 and 11011001?

View solution