Testbank for Cryptology and Error Correction 2006 Childs Exercises and Solutions PDF

Cryptology and Error Correction (2006) –
Childs – Exercises with Solutions PDF

1. Checksums use _________

arithmetic.

A) one's complement arithmetic

B) two's complement arithmetic

C) either (a) or (b)

D) none of the above - answer-A



2. The checksum of 1111 and 1111 is_________.

A) 0000

B) 1111

C) 1110

D) 0111 - answer-A



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

inclusive.

A) 1 to 10

B) 0 to 10

C) 1 to 11

D) none of the above - answer-B




1

, 4. In cyclic redundancy checking, the

divisor is _______ the CRC.

A) one bit less than

B) one bit more than

C) The same size as

D) none of the above - answer-B



5. The ________ between two words is the number of differences between

corresponding bits.

A) Hamming rule

B) Hamming code

C) Hamming distance

D) none of the above - answer-C



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

A) range

B) power

C) degree

D) none of the above - answer-C



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

A) addition and subtraction

B) addition and multiplication

C) addition and division



2