Suppose that a packet’s payload consists of 10 eight-bit values (e.g., representing ten ASCII-encoded characters) shown below. (Here, we have arranged the ten eight-bit values as five sixteen-bit values). Compute the two-dimensional parity bits for the 5 rows (starting from the top). Combine the bits into one string. 01111001 00111000 11111001 00111000 11011111 11011101 01101010 00110010 10110110 01110010

Suppose that a packet’s payload consists of 10 eight-bit values (e.g., representing ten ASCII-encoded characters) shown below. (Here, we have arranged the ten eight-bit values as five sixteen-bit values). Compute the two-dimensional parity bits for the 5 rows (starting from the top). Combine the bits into one string. 01111001 00111000 11111001 00111000 11011111 11011101 01101010 00110010 10110110 01110010

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 3VE

See similar textbooks

Similar questions

Assume we have a code composed of 5 ternary codewords of varying lengths (1, 1, 2, 2, 3). How many unique messages comprised of two message symbols result in a series of four code symbols after encoding?
Suppose we use a checksum scheme based on the addition of successive 8-bit fields rather than 16-bit fields as in the Internet Transport layer. Now suppose that the following 3 bytes are received, in which the last bytes is the checksum field. 0 1 0 1 0 0 1 1 1 1 0 1 0 1 0 0 1 1 0 1 0 1 1 1 Does the receiver detect an error that might have occurred during the transmission of these three bytes?
Suppose the sender and the receiver agree to use the bit pattern 01111110 to mark the beginning and the end of a frame. 1)The sender has the following bits to send. What does the sender actually send? 011110000111111011101111101 2) The receiver receives the following bits. What're the original data bits (note: this question has nothing to do with the previous question) 01111110111110111110001101111101000011111001111110
Suppose the information content of a packet is the bit pattern 1110 0110 1001 1101 and an even parity scheme is being used. What would the value of the field containing the parity bits be for the case of a two-dimensional parity scheme? Your answer should be such that a minimum length checksum field is used.
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.
4. Suppose we have to transmit a list of five 4 bit numbers that we need to send to a destination. Show the calculation using checksum method at the sender and receiver side if the set of numbers is ( 3, 7, 9, 11, 13).
In this problem, we will get practice with computing the one’s complement of the one’s complement sum over a sequence of data values. We will use the exact same algorithm used to compute TCP/UDP checksum, but over a sequence of 4-bit chunks rather than 16-bit chunks. (a) Consider the following data bits. What is the (4-bit) checksum of this (8-bit) data? 0101 1100 (b) Consider the following data bits. What is the 4-bit checksum of this (12-bit) data? (Note: you may be able to reuse calculations from part (a).) 0101 1100 1001
Suppose the message that should be transmitted from host A to host B contains the following four bytes: 01110111, 11011010, 10011101, and 00110011. Find the checksum of this message computed by host A, assuming the checksum is computed as sum of bytes rather than sum of 16 bits. Show your work.
1. Suppose the information content of a packet is the bit pattern as shown below, and an even parity scheme is being used. What would the value of the field containing the parity bits be for the case of a two-dimensional parity scheme? 1 1 1 00 1 1 01 0 0 11 1 0 1
I88. Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. Manchester using each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level...
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?
a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret prefix MAC…