This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: n = 143 and the enciphering exponent is e = 103 , where n = 143 = 11 × 13 . (a) Compute the deciphering exponent d. (b) Assume that the following letter to number translation table is used: J = 1 ,Q = 2 ,R = 3 ,L = 4 ,D = 5 ,A = 6 ,S = 7 ,Y = 8 ,T = 9 ,O = 0 Encrypt the message ” SO”. (c) Assume that a message has been grouped into blocks of two letters, enciphered and send out as 10 03 . Decipher the message. 5. Let C be a binary code with generator matrix 1 1 1 1 1 1 1 1 1 (a) Find the Partity check matrix of C . (b) Find all of the codewords of C (c) How many redundant digits are there in a codeword? (d) What is the minimum distance d of C ? (e) How many errors can it detect? How many errors can it correct? (f) Use this coding to encode 101....
View
Full
Document
This note was uploaded on 12/11/2011 for the course MATH 4023 taught by Professor Staff during the Spring '08 term at LSU.
 Spring '08
 Staff
 Math, Algebra

Click to edit the document details