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

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