Q. The _____of errors is more difficult than the ______.

View solution

Q. In modulo-11 arithmetic, we use only the integers in the range ______, inclusive.

View solution

Q. In modulo-2 arithmetic, we use only ______.

View solution

Q. Adding 1 and 1 in modulo-2 arithmetic results in _________.

View solution

Q. In block coding, if k =2 and n =3, we have _______ invalid codewords.

View solution

Q. The Hamming distance between equal codewords is _________.

View solution

Q. The Hamming distance between 100 and 001 is ________.

View solution

Q. In block coding, if n = 5, the maximum Hamming distance between two codewords is ________.

View solution

Q. If the Hamming distance between a dataword and the corresponding codeword is three, there are _____ bits in error.

View solution

Q. The _______ of a polynomial is the highest power in the polynomial.

View solution

Q. The divisor in a cyclic code is normally called the _________.

View solution

Q. A generator that contains a factor of ____ can detect all odd-numbered errors.

View solution

Q. Checksums use _________ arithmetic.

View solution

Q. In one's complement arithmetic, if positive 7 is 0111, then negative 7 is ________.

View solution

Q. The checksum of 1111 and 1111 is _________.

View solution

Q. The checksum of 0000 and 0000 is __________.

View solution

Q. In a Go-Back-N ARQ, if the window size is 63, what is the range of sequence numbers?

View solution

Q. In Go-Back-N ARQ, if frames 4, 5, and 6 are received successfully, the receiver may send an ACK _______ to the sender.

View solution

Q. ARQ stands for _______.

View solution

Q. For Stop-and-Wait ARQ, for 10 data packets sent, _______ acknowledgments are needed.

View solution