Anyone from qlsor grax herein bs
1 answer:
You might be interested in
Answer:
code = 010100000001101000101
Explanation:
Steps:
The inequality yields , 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