Respuesta :
Answer:
code = 010100000001101000101
Explanation:
Steps:
The inequality yields [tex]2^{k} - 1 > = M+K[/tex], where M = 16. Therefore,
The second step will be to arrange the data bits and check the bits. This will be as follows:
Bit position number Check bits Data Bits
21 10101
20 10100
The bits are checked up to bit position 1
Thus, the code is 010100000001101000101
Answer:
code = 010100000001101000101
Explanation:
These are the steps:
The inequality is written as follows:
2^k - 1 >= M + K
where M = 16.
Therefore, the next step will be, arranging the data bits and checking the bits.
This is done as follows:
Bit position Number Check bits Data Bits
21 10101
20 10100
The bits are thus checked in this manner, up to bit position 1
Therefore, the code is written as:
010100000001101000101