Question

amon
4 points
Suppose we want to transmit the message 1011 0010 0100 1011 and protect it from errors. Write down the new message with diferent chedums attached
1) Use the GRCA polynomial long division (X4 +*+1) to determine the message that should be transmitted:
2) Use 2D parity as the checksum:
1011_
0010_
0100
1011
3) Suppose the leftmost bit of the message is inverted due to noise on the transmission link. How does the receiver know that an error has occurred in this position it 2D
und?
4) You may realize that in 2D parity, the last bit is always the same no matter you calculate it from the row or the column Why? (Bonus question)
For the toolbar, press ALT F10 (PC) or ALT+FN+F10 (Mac).
B I US Paragraph
Arial
10pt
=
I *o Q
6E = = =
XX, og
ST TO
1
[+
v
TT
11 Ω
田田田田
BE
<> † (3)​

Answer 1

Answer:

the answer will be infinite

Step-by-step explanation:

the question you have given is around