Problem 7pin For the CRC error detection scheme, consider the 5-bit generator G = 10101, and suppose that data D has the value: a) 1001100101; b) 0101001101. What is the value of reminder R for these 2 cases? What are the final resulting messages to be transmitted for these 2 cases? Show detailed procedures for full credits.

Problem 7pin For the CRC error detection scheme, consider the 5-bit generator G = 10101, and suppose that data D has the value: a) 1001100101; b) 0101001101. What is the value of reminder R for these 2 cases? What are the final resulting messages to be transmitted for these 2 cases? Show detailed procedures for full credits.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 8P

See similar textbooks

Similar questions

Problem with constructing MAC. The messages X to be authenticated consists of z independent blocks, so that: X = x1||x2|| . . . ||xz, where every xi consists of |xi| = 8 bits. The input blocks are consecutively put into the compression function ci = h(ci−1, xi) = ci−1⊕xi At the end, the MAC value: MACk(X) = cz+k mod 28 is calculated, where k is a 64-bit long shared key. Describe how exactly the (effective part of the) key k can be calculated with only one known message X.
Computer Science With the CBC/OFB/CFB/CTR mode: (a) if there is a single bit transmission error in block C3 of the ciphertext, which plaintext blocks are affected? CBC and CTR (b) Suppose that there is a bit error in the source version of P1. Through how many ciphertext blocks is this error propagated? What is the effect at the receiver?
Question 17 Aa.For an original message size of 14 bits in a Hamming code FEC system, which one of the following bit position in the resulting message does the third parity bit NOT protect? 5 13 7 4 16 14 6 12 15 Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
Suppose that a binary message – either 0 or 1 – must be transmitted by wire from location Ato location B. However, the data sent over the wire are subject to a channel noise disturbance,so to reduce the possibility of error, the value 2 is sent over the wire when the message is1, and the value −2 is sent when the message is 0. If X, X = {−2,2}, is the value sent atlocation A, the value received at location B, denoted as R, is given byR = X + N ,where N is the channel noise disturbance, which is independent of X. When the message isreceived at location B, the receiver decodes it according to the following rule:if R ≥.5, then conclude that message 1 was sentif R < .5, then conclude that message 0 was sentAssuming that the channel noise, N, is a unit normal random variable and that the message0 or 1 is sent with equal probability, what is the probability that we conclude that the wrongmessage was sent? This is the probability of error for this communication channel
q7- Consider a Code Division Multiple Access system in which transmitting users A, B & C have the codes (1 1 1 1 -1 -1 -1 1), (1 1 1 1 1 1 1 1) and (1 1 1 -1 1 1 1 1) respectively similar to the Walsh codes of other users. The receiver intends to receive data transmitted by user C a) Find the bit transmitted if A, B are transmitting 1 and C is idle Result is 6, hence output is 1 Result is -14, hence output is 0 Result is 14, hence output is 1 Result is -6, hence output is 0 Result is Answer, hence output is Answer b) Find the bit transmitted if A, B and C are transmitting 1 Result is 6, hence output is 1 Result is -14, hence output is 0 Result is 14, hence output is 1 Result is -6, hence output is 0 Result is Answer, hence output is Answer
For the given message sequence with their probabilities, Apply Shannon Fano coding, and calculate the code efficiency. [x] = [x1 x2 x3 x4 x5 x6 x7 x8]; [P] [1/4 1/8 1/16 1/16 1/16 1/4 1/16 1/8]
In a two-dimensional decimal parity-check which uses check digits, if we receive the following transmission: 257103550 Assuming there is at most 1 error, which of the following is the correct original underlying message: a) 257303550 b) 217503550 c) 2150 d) 7355 e) 2530
Q1. (a) Find CRC code for message bits to be transmitted which is 11001110 with generator value 1011 known to receiver. (b) Explain in detail Go-Back-N ARQ Protocol with timeline diagram.
Suppose Alice and Bob are going to communicate using AES in CBC mode. Unfortunately Alice's message length (in bytes) is not a multiple of 16. Suppose the last block of her message is just a single zero byte. How can she pad out the last block so that she can use CBC mode? Since this needs to be a reversible operation, how does Bob recognize the padding and remove it?
not handwritten A 3000-km long, 1 Mbps link is used to transmit 1000-bit data packets using the Selective Repeat protocol. If the speed of light in this link is 2 x 105 km/second. What is the minimum number of bits the sequence numbers should be? Assume no flow control, and negligible transmission and processing times for acknowledgments. (Take 1M = 1000,000.)
1. What other error-detection techniques are available? How do they compare to parity and cyclic redundancy checksum?2. What is intermodulation distortion? What sorts of signals are susceptible to this form of distortion?3. Find an example of another Hamming code and describe how it works4. Describe two situations in which error-free transmission is crucial to communications
Compute CBC-MAC for a message of 16 bits, “ABCD” (in Hexa). Assume a block size of 8 bits with an IV=C9 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be D8 (in Hexa).