Computer network

Problem 1. 2D Parity (10 pt.)

Suppose the information portion of a packet contains 5 bytes as follows:

D: 01001100 01101001 01101110 01101011 00100000

Suppose an odd parity scheme is being used. What would be the value of the field containing the parity bits be for the case of a two-dimensional parity scheme? Assume the bits in D are divided into 5 rows and 8 columns (i.e., a single byte becomes a row).

Problem 2. CRC (20 pt.)

Assume that the message M has to be transmitted. Given the generator function G for the CRC scheme, calculate CRC. What will be the bit sequence that actually gets transmitted?

a.M: 10100001 (8 bits), G: 1001 (4 bits)

b.M: 1101011011 (10 bits), G: 10011 (5 bits)

Sample Solution