Suppose we want to transmit the message 101100100100 1011 and protect it from errors using the CRC-8 polynomial x8 + x² + x¹ + 1. (a) Use polynomial long division to determine the message that should be trans- mitted. (b) Suppose the leftmost bit of the message is inverted due to noise on the trans- mission link. What is the result of the receiver's CRC calculation? How does the receiver know that an error has occurred?

Suppose we want to transmit the message 101100100100 1011 and protect it from errors using the CRC-8 polynomial x8 + x² + x¹ + 1. (a) Use polynomial long division to determine the message that should be trans- mitted. (b) Suppose the leftmost bit of the message is inverted due to noise on the trans- mission link. What is the result of the receiver's CRC calculation? How does the receiver know that an error has occurred?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 10VE

See similar textbooks

Similar questions

Suppose we want to transmit the message 1011 0010 0100 1011 and protect it from errors using the CRC-8 polynomial x8 + x² + x¹ + 1. (a) Use polynomial long division to determine the message that should be trans- mitted. (b) Suppose the leftmost bit of the message is inverted due to noise on the trans- mission link. What is the result of the receiver's CRC calculation? How does the receiver know that an error has occurred?
Suppose we want to transmit the message 1011 0010 0100 1011 and protect it from errors using the CRC8 polynomial x³ + x² + x¹ + 1. 8 (a) Use polynomial long division to determine the message that should be transmitted. (b) Suppose the leftmost bit of the message is inverted due to noise on the transmission link. What is the result of the receiver's CRC calculation? How does the receiver know that an error has occurred?
Consider the message M = 1111001101. Calculate the cyclic redundancy check (CRC) for this message using the divisor polynomial x5 + x4 + x2 + 1. Also calculate error code if the 6th bit is flipped in received data. Note: consider Most Significant bit (MSB) as first bit.
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?
Suppose a 1 Megabit message is to be transmitted over 2 hops in a network. The transmission lines in the network are not error free but are independent of each other. Each hop has BER=105. Calculate how many bits need to be transmitted to deliver the message using message switching.
In the following situation, kindly mention whether or not there was a mistake made. The number "001011010" is sent to the receiver by the sender. The devices make use of an odd parity, an eight-bit data, and a one-bit (LSB) parity for each bit of data respectively. What results may we anticipate if the devices make use of even parity as opposed to odd parity? What kinds of communication protocols are used by TESLA automobiles? Provide the schematic for the one or ones that you have discovered.
Consider that we want to transmit a message 1100011 by using the CRC polynomial x³ + 1. But due to noise, the leftmost bit of the message is inverted. Then what message will be transmitted to the receiver after this?
Suppose the information content of a packet is the bit pattern 1110101010101111 and an even parity scheme is being used. What would the value of the checksum field be for the case of a two-dimensional parity scheme? Your answer should be such that a minimum-length checksum field is used.
Using SHA-512, if the length of the original message is 6600 bits, what is the number of padding bits needed?
b) The distance between a sender and a receiver of a data communication system is 1400 km and the propagation speed is 2.5 x 10° m/s. The system uses 5-bit sequence numbers whenever possible. Ignore waiting and processing delays. Also ignore the overhead due to the header and the trailer and assume no data or control frame is lost or damages during transmission. If each packet carries 1000 bits of data how long does it take to send 7 million bits of data for the following cases: If Go-Back-N ARQ protocol is used. If Selective-Repeat ARQ protocol is used. ii.
Please say if there was a mistake in the following situation. The number "001011010" is sent to the receiver by the sender. Each bit of data in the devices has a one-bit (LSB) parity and an odd parity. Each bit of data has eight bits. What happens if even parity is used instead of odd parity? What kinds of communication protocols do TESLA cars use? Include the plans for the one or ones you found.
b) The distance between a sender and a receiver of a data communication system is 1400 km and the propagation speed is 2.5 x 10° m/s. The system uses 5-bit sequence numbers whenever possible. Ignore waiting and processing delays. Also ignore the overhead due to the header and the trailer and assume no data or control frame is lost or damages during transmission. If each packet carries 1000 bits of data how long does it take to send 7 million bits of data for the following cases: i. If Go-Back-N ARQ protocol is used. ii. If Selective-Repeat ARQ protocol is used. c) Compare and contrast byte-stuffing and bit-stuffing, then demonstrate bit-stuffing the following frame payload shown in Figure 3(c). 111110 1011| 1 1 1 1|o0 1 10|O Figure 3(c)