4. Consider the CRC polynomial P-11012=X³ + X² + 1. a) In order to compute the CRC code word for the information, 1-1110101102, How many bits of CRC check sum will be appended? b) In order to send the above information, I, what is the message M will be sent to a receiver with check bits(remainder)? = c) If the following message, M- 110110100010 is transmitted to the receiver, what is the remainder of this message? Does it have a transmission error or not?

4. Consider the CRC polynomial P-11012=X³ + X² + 1. a) In order to compute the CRC code word for the information, 1-1110101102, How many bits of CRC check sum will be appended? b) In order to send the above information, I, what is the message M will be sent to a receiver with check bits(remainder)? = c) If the following message, M- 110110100010 is transmitted to the receiver, what is the remainder of this message? Does it have a transmission error or not?

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter4: Making Decisions

Section: Chapter Questions

Problem 9RQ

See similar textbooks

Similar questions

Q3 PPLZ,
Q6 PPLZ,
Consider the following binary number: 1.11000000000000000000100. What are the values of guard, round , and sticky bits after 8 right shifts? The encoding of the options is (guard)(round)(sticky). For example, if guard bit is 1, round is 0, and sticky bit is 0, the encoding is 100. 100 001 00 010 Arrange the steps involved in floating point multiplication. The first step must be at the top and the last step must be at the bottom. You can assume that the result is still normalized after rounding. Start 1 | Multiply the significands 2 E Set the sign of the result 3 | Check for overflow or underflow. If true, flag an exception, otherwise continue. 4 E Subtract bias from the sum | Add biased exponents of the two numbers 6 E Normalize the product, if needed 7 | Round the significand Done
Q4 PPLZ,
] In the following problems, check suitable rule (Sum, Subtraction or Product) and compute the total number of possible ways in the entire procedure: The password for a computer account can be 6, 7 or 8 characters in length; the characters can be letters or digits. What is the number of ways a password can be formed? How many bit strings of length sixteen start with a 11 or end with 00?
The parity function is a very simple hash function producing a one-bit digest, which is 0 if the number of bits in the message is even and 1 if it is odd. Consider a communication system that uses 7 bits out of every byte to transmit data, and reserves the 8th bit (the one on the right) to transmit the parity of the other seven bits, for purposes of error checking. Below is the binary representation of some bytes that were transmitted using this system. For each one, tell whether there is a reason to suspect an error in transmission, giving the reason for your answer. 10110011 11101111 10101100 00110011
Msg3. B→A : B, N1, Ks, Message2, h(B, N1, Message2) Whereas: h(m) represents the digest of the message (m). {m}{K} represents the encryption of message (m) using the key (K) PK is public key N1 is a random number. 1. What are the main problems in Msg3?
A code must have certain properties in order that any errors can be corrected. Let CC Z be the code C = {23410, 34102, 44113, 21110, 01103}. Which of these scenarios shows that C is not 1-error correcting? O If 44113 is sent and an error changes the second digit 4 to 1, the receiver cannot know what error has occurred. O If the receiver gets the word 00000, they cannot know what message was sent. O If 23410 is sent and an error change the 3rd digit to 1, the receiver cannot know what error has occurred. O If 23410 is sent and an error moves the first digit 2 to the last place, making 34102, the receiver cannot know that any error has occurred
We have intercepted a message that we need to decode. Luckily, we know that they use the letters A to Z, space, 0 to 9. We also know that when they encode messages they start by shifting the first letter once to the left, then shift the next twvo letters right twice, then the next three letters left 3 times, then the next four letters right 4 times, the next five letters left 5 times, and so on. a. If the message intercepted was HMMG2WEIAO what was the original message? b. What would we get if we encoded the phrase 2750H FRSC (the Os are zeros) using the given algorithm?
To prevent the tapping and use of information on a wireless network which has brought untold mistrust amongst the directors of Okonko Systems, you suggested that every message that is transmitted should go through the following: A systematic two left bit shift; After “a” above, the algorithm f[(6m +2) + k] mode 13 should be applied to the cipher text, where m is the message and k =9 is a key; After “b” above, perform a systematic right bit shift to the new cipher; The message should then be transmitted. If on a trial basis, the message is “genomics” Use the mono – alphabetic letters where a = 0, b = 1, ….z = 25 to find the cipher that would be transmitted
Use the congruence c ≡ (3p + 4)(mod 26) to decode the message.
Using the matrix A= 1 L-11 -1] 0 decode the received message: -1 4 2 -12 -1 -12 13 26 -265 -14 -23 100 -6 7 -121. (Hint: Assign a number to each letter of the alphabet: A is 1, B is 2, and so on. A space between words is 27). Transmission Message A |Decoded Message Encoding Matrix Decoding Matrix