2. As you can see from above, a Hamming Code works as follows: Bit position 1 ch
ID: 3702878 • Letter: 2
Question
2. As you can see from above, a Hamming Code works as follows: Bit position 1 checks every other bit, starting from itself. Bit position 2 checks 2 bits, skips 2 bits, checks 2 bits, skips 2 bits..., starting from itself. Bit position 4 checks 4 bits, skips 4 bits, checks 4 bits, skips 4 bits..., starting from itself. Bit position 8 checks 8 bits, skips 8 bits, checks 8 bits, skips 8 bits..., starting from itself. Assuming I have 26 data bits, how many parity bits should I have and where should they be placed in the string? (2 points)Explanation / Answer
Let the data bits are D1 D2...D26
So Data Bits will take places as
D26 D25 D24 D23 D22 D21 D20 D19 D18 D17 D16 D15 D14 D13 D12 P16 D11 D10 D9 D8 D7 D6 D5 P8 D4 D3 D2 P4 D1 P2 P1
As we can see above for 26 data bits we require to send 5 additional bits i.e total 31 bits will be send
So total 5 parity bits
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.