Compute the 3-bit CRC for a given message M and a generator polynomial G(X). M i

Question

Compute the 3-bit CRC for a given message M and a generator polynomial G(X). M is 0111101 and G(X) is X3+X+1. Let the message M along with CRC is transmitted from node A and to node B. Node B receives erroneous message 0001101. Can b detect the error? Consider sender 1 and sender 2 with data bits 01 and 11 respectively. suppose CDMA is used as the multiple access technique. Sender 1 has code (1, 1, 1, 1). Sender 2 has code (1, -1, 1, -1). Sender 1 and sender 2 transmit simultaneously. Suppose a receiver wants to receive the data being sent by sender 2. Show (by calculation) that the receiver is indeed able to recover sender 2's data by using sender 2's code. In the figure below, show the address fields (MAC and IP) when a packet is transmitted from B to D.

Explanation / Answer

1 1 1 1 0 1

ans 3-   

1 0 1 -qoutient

1011| 0 1 1 1 1 0 1

1 1 0 1   

0 1 0 0 0 1

1 0 1 1

1 0 0 0 reminder

Transmitted frame- 1000011

If any error occur reciever can detect error.

Reciever can divide the transmitted frame with divident. If remainder zero then no any error.

Ans-5 it contain the source IP address of B and receiver IP address of D. it not contain mac address for transmitted the data.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.