Q. ____________ is added to data packet for error detection.

View solution

Q. Which error detection method uses one's complement arithmetic?

View solution

Q. Which error detection method consists of just one redundant bit per data unit?

View solution

Q. In cyclic redundancy checking, what is the CRC?

View solution

Q. In cyclic redundancy checking, the divisor is _______ the CRC.

View solution

Q. A ___________ error means that two or more bits in the data unit have changed.

View solution

Q. In ________ error correction, the receiver corrects errors without requesting re-transmission.

View solution

Q. In ________ error correction, the receiver asks the sender to send the data again.

View solution

Q. We can divide coding schemes into two broad categories: ________ and ______coding.

View solution

Q. In modulo-2 arithmetic, __________ give the same results.

View solution

Q. In modulo-2 arithmetic, we use the ______ operation for both addition and subtraction.

View solution

Q. In _____ coding, we divide our message into blocks, each of k bits, called ___.

View solution

Q. We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are called _________.

View solution

Q. The ________ between two words is the number of differences between corresponding bits.

View solution

Q. To guarantee the detection of up to 5 errors in all cases, the minimum Hamming distance in a block code must be _______.

View solution

Q. To guarantee correction of up to 5 errors in all cases, the minimum Hamming distance in a block code must be ________.

View solution

Q. In a linear block code, the _______ of any two valid codewords creates another valid codeword.

View solution

Q. A simple parity-check code can detect __________ errors.

View solution

Q. _______codes are special linear block codes with one extra property. If a codeword is rotated, the result is another codeword.

View solution

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

View solution