Skills Check

Skills Check

Question 17.1

1. If three film critics listed their ratings of a film with thumbs up (U) or thumbs down (D)—for example, one outcome is UDU—and critic number 1’s rating is first, critic number 2’s rating is second, critic number 3’s rating is third—the number of possible outcomes is

  1. 6.
  2. 8.
  3. 9.

1.

b

Question 17.2

2. A four-digit binary message was encoded using Table 17.1 and the message 1010010 was received. Using the nearest-neighbor method, the decoded four-digit message is __________________________.

2.

1011

Question 17.3

3. Using the circle diagram in Figure 17.1 to encode the message 1011, the encoded message is

  1. 1011001.
  2. 1011010.
  3. 1010001.

3.

b

Question 17.4

4. The distance between received words 1011001 and 1000101 is ______________________.

4.

3

Question 17.5

5. Using the nearest-neighbor method and the code in Table 17.2, the word 1110011 decodes as

  1. 0110010.
  2. 1100011.
  3. 1010001.

5.

b

Question 17.6

6. The weight of the binary linear code {0000000, 0011111, 0101011, 0110100} is ___________.

6.

3

Question 17.7

7. If the two messages 0 and 1 are encoded as 000 and 111, respectively, the number of errors that the code can correct is

  1. 0.
  2. 1.
  3. 2.

7.

b

Question 17.8

8. If a binary linear code has weight 4, the maximum number of errors that it will detect is _______________.

8.

3

Question 17.9

9. If every pair of code words differs in at least five positions, then nearest-neighbor decoding can decode words accurately that have

  1. two errors.
  2. three errors.
  3. four errors.

9.

a

Question 17.10

10. Using the encoding scheme , the string 010110 decodes as

  1. ABCB.
  2. ABCA.
  3. ABACA.

10.

b

Question 17.11

11. Use delta encoding to compress the following numbers: .

11.

Question 17.12

12. Given that the following numbers were encoded using the delta function, determine the original numbers: .

12.

1221 1231 1216 1213 1225 1233

Question 17.13

13. Find the following values: ; ; .

13.

5; 9; 4

Question 17.14

14. Solve the equation .

14.

11

Question 17.15

15. The Caesar cipher would encrypt GO HOME NOW as

  1. JR KRPH QRZ.
  2. DL ELJB KLT.
  3. Neither of these answers is correct.

15.

a

Question 17.16

16. The permissible values for the key of a decimation cipher are ______________.

16.

3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25

Question 17.17

17. Use the decimation cipher with key 9 to encrypt the message RUN.

17.

XYN

Question 17.18

18. Describe the cipher obtained when the values and are used in the linear cipher formula .

18.

Every letter is unchanged.

Question 17.19

19. If a message were encrypted using the decimation cipher with the key 9, what value would you use to decrypt it? (Answer this question without looking at Table 17.4.)

  1. 3
  2. 5
  3. 7

19.

a

Question 17.20

20. The name for the cipher obtained when the value is used in the linear cipher formula is

  1. Vigenère.
  2. Caesar.
  3. decimation.

20.

b

Question 17.21

21. Using the Vigenère cipher and the keyword ADAM to decrypt EIEIO, we obtain

  1. ELELR.
  2. EFEFL.
  3. EFEWO.

730

21.

c

Question 17.22

22. Counting the permutation , how many permutations of 1, 2, 3 are there?

22.

Question 17.23

23. Given , find .

23.

Question 17.24

24. If is a permutation cipher involving 1, 2, 3, 4, 5, 6, what is the length of the plaintext blocks?

24.

6

Question 17.25

25. If a permutation of the integers 1, 2, 3, 4, 5 was to encode the message MEET THE BOSS AT NOON, what would the blocks be?

25.

MEETT HEBOS SATNO ONXQZ

Question 17.26

26. If the first word of a message to be encrypted using a Playfair cipher was FLEET, how would it be converted to pairs of letters?

26.

FL EX ET

Question 17.27

27. If the first word of a message to be encrypted using a Playfair cipher was JET, how would it be converted to pairs of letters?

27.

IE TX

Question 17.28

28. The sum of the binary strings 1011001 and 1001101 is __________.

28.

0010100

Question 17.29

29. If is a binary string of length 8, what string is ?

29.

00000000

Question 17.30

30. Let . Find a string such that .

30.

0001100